88 search results - page 2 / 18 » New Inference Rules for Efficient Max-SAT Solving |
JAIR
2008
14 years 11 months ago
2008
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
SAT
2005
Springer
15 years 5 months ago
2005
Springer
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality.
84
Voted
CPAIOR
2006
Springer
15 years 3 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
IJCAI
2007
15 years 1 months ago
2007
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, wh...
81
Voted
ENTCS
2008
14 years 11 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...