882 search results - page 16 / 177 » Local Search for Very Large SAT Problems |
JAR
2000
13 years 7 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
AAAI
2004
13 years 8 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
AAAI
1993
13 years 8 months ago
1993
Recently several local hill-climbing procedures for propositional satisability have been proposed, which are able to solve large and di cult problems beyond the reach of conventio...
AI
2003
Springer
14 years 19 days ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
CP
2005
Springer
14 years 28 days ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...