2006 and 2007 Max-SAT evaluations: contributed instances

MaRDI QIDQ3604009zbMATH OpenFDO

Authors Federico Heras, Javier Larrosa, Simon de Givry, Thomas Schiex

Publication date 24 February 2009

zbMATH Keywords

Max-SAT problem instances

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The first and second Max-SAT evaluations
• Modelling Max-CSP as Partial Max-SAT
• Minimaxsat: an efficient weighted Max-SAT solver
• SAT-based MaxSAT algorithms
• Solving Max-SAT as weighted CSP

Cited in

(9)

• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• Optimizing with minimum satisfiability
• Incomplete inference for graph problems
• Iterative and core-guided maxsat solving: a survey and assessment
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• The first and second Max-SAT evaluations
• Boolean lexicographic optimization: algorithms \& applications
• Reformulation based MaxSat robustness
• Multi-objective maximum satisfiability by single-objective implicit hitting set optimization

Describes a project that uses

Uses Software

• ABACUS
• Pueblo

This page was built for publication: 2006 and 2007 Max-SAT evaluations: contributed instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604009)