28 search results - page 5 / 6 » Translating Pseudo-Boolean Constraints into SAT |
AI
2004
Springer
13 years 6 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
ISSTA
2004
ACM
14 years 10 hour ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
CAV
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
STOC
2012
ACM
11 years 9 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...