192 search results - page 3 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
SAT
2004
Springer
13 years 11 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
AAAI
2006
13 years 7 months ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
AIPS
2008
13 years 8 months ago
2008
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
ECAI
2010
Springer
13 years 3 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
AAAI
2010
13 years 4 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...