3 search results - page 1 / 1 » Hard Satisfiable Clause Sets for Benchmarking Equivalence Re... |
JSAT
2006
13 years 4 months ago
2006
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
AICOM
2006
13 years 5 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...