The first and second Max-SAT evaluations

View/ Open
Issue date
2008Suggested citation
Argelich Romà, Josep;
Li, Chu-Min;
Manyà Serres, Felip;
Planes Cid, Jordi;
.
(2008)
.
The first and second Max-SAT evaluations.
Journal on Satisfiability, Boolean Modeling and Computation, 2008, vol. 4, p. 251-278.
http://hdl.handle.net/10459.1/56661.
Metadata
Show full item recordAbstract
We describe the organization and report on the results of the First and Second Max-SAT
Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the
International Conference on Theory and Applications of Satisfiability Testing (SAT-2006
and SAT-2007), discuss the insights gained and point out new directions for forthcoming
evaluations. The main objectives of both evaluations were assessing the advancements
in the field of Max-SAT solvers through a comparison of their performances, identifying
successful solving techniques and encouraging researchers to develop new ones, and creating
a publicly available collection of challenging Max-SAT benchmarks.
Is part of
Journal on Satisfiability, Boolean Modeling and Computation, 2008, vol. 4, p. 251-278European research projects
Collections
Related items
Showing items related by title, author, creator and subject.
-
Analyzing the instances of the MaxSAT evaluation
Argelich Romà, Josep; Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2011)The MaxSAT Evaluation [1] is an affiliated event of the SAT Conference that is held every year since 2006, and is devoted to empirically evaluate exact MaxSAT algorithms solving any of the following problems: MaxSAT, ... -
New Inference Rules for Max-SAT
Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (Association for the Advancement of Artificial Intelligence, 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 simplified formula that preserves satisfiability ... -
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)One of the main differences between complete SAT solvers and exact Max-SAT solvers is that the former make an intensive use of unit propagation at each node of the proof tree while the latter, in order to ensure optimality, ...