Sciweavers

38 search results - page 1 / 8
» A New Algorithm for Weighted Partial MaxSAT
Sort
View
AAAI
2010
13 years 3 months ago
A New Algorithm for Weighted Partial MaxSAT
We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver. We prove the correctness of our algorithm and compare our solver with other We...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
AAAI
2007
13 years 7 months ago
Inference Rules for High-Order Consistency in Weighted CSP
Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CP
2009
Springer
14 years 5 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche
AI
2005
Springer
13 years 4 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
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...
Zhao Xing, Weixiong Zhang
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...