50 search results - page 3 / 10 » On Solving MaxSAT Through SAT |
AI
2005
Springer
13 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
CP
2003
Springer
13 years 11 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
CP
2005
Springer
13 years 12 months ago
2005
Springer
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT p...
ECAI
2008
Springer
13 years 8 months ago
2008
Springer
The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an ...
JAIR
2007
13 years 6 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...