This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...
Krishnendu Chatterjee, Luca de Alfaro, Marco Faell...
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...