Solving weighted Max-SAT problems in a reduced search space: a performance analysis

MaRDI QIDQ3604006zbMATH OpenFDO

Authors Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche

Publication date 24 February 2009

zbMATH Keywords

constraint relaxationlower bound computationmaximum satisfiability problem

Mathematics Subject Classification ID

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

Recommendations

• A logical approach to efficient Max-SAT solving
• Minimaxsat: an efficient weighted Max-SAT solver
• An efficient solver for weighted Max-SAT
• Solving Max-SAT as weighted CSP
• AI 2003: Advances in Artificial Intelligence

Cited in

(9)

• Incomplete inference for graph problems
• Iterative and core-guided maxsat solving: a survey and assessment
• A taxonomy of exact methods for partial Max-SAT
• Algorithms for Weighted Boolean Optimization
• Boolean lexicographic optimization: algorithms \& applications
• Curriculum-based course timetabling with SAT and MaxSAT
• On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
• Resolution-based lower bounds in MaxSAT
• Solving sparse instances of Max SAT via width reduction and greedy restriction

Describes a project that uses

Uses Software

• MiniSat
• Siege
• Chaff

This page was built for publication: Solving weighted Max-SAT problems in a reduced search space: a performance analysis

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