Sciweavers

248 search results - page 6 / 50
» Circuit-based Boolean Reasoning
Sort
View
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
14 years 8 months ago
Boolean Decomposition Using Two-literal Divisors
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...
Nilesh Modi, Jordi Cortadella
LICS
2008
IEEE
14 years 2 months ago
Piecewise Testable Tree Languages
— 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,...
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
DLOG
2008
13 years 10 months ago
Checking DL-Lite Modularity with QBF Solvers
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...
QEST
2006
IEEE
14 years 1 months ago
Compositional Quantitative Reasoning
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...
SAT
2004
Springer
109views Hardware» more  SAT 2004»
14 years 1 months ago
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
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...
Alessandro Armando, Claudio Castellini, Enrico Giu...