152 search results - page 5 / 31 » Efficiently Exploiting Dependencies in Local Search for SAT |
CP
2004
Springer
14 years 21 days ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
EPIA
1997
Springer
14 years 1 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
ICTAI
2002
IEEE
14 years 1 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...