60 search results - page 3 / 12 » The Connectivity of Boolean Satisfiability: Computational an... |
LICS
2006
IEEE
14 years 21 days ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
RELMICS
1998
Springer
13 years 11 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
DAC
2004
ACM
14 years 7 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
AI
2010
Springer
13 years 6 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
DAC
2005
ACM
14 years 7 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...