29 search results - page 1 / 6 » Complete Local Search for Propositional Satisfiability |
AAAI
2004
13 years 6 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...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
JETAI
2008
13 years 4 months ago
2008
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
AAAI
2000
13 years 6 months ago
2000
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
C3S2E
2010
ACM
13 years 6 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...