210 search results - page 2 / 42 » Universal Booleanization of Constraint Models |
AAAI
2006
13 years 7 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
CAV
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
ICALP
2007
Springer
14 years 9 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
SARA
2007
Springer
14 years 7 days ago
2007
Springer
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
ISSTA
1998
ACM
13 years 10 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...