Exact MinSAT Solving

DOI10.1007/978-3-642-14186-7_33MaRDI QIDQ4930605zbMATH OpenOpenAlexFDO

Authors Chu-Min Li, Felip Manya, Zhe Quan, Zhu Zhu

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14186-7_33

Mathematics Subject Classification ID

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

Cited in

(5)

• Optimizing with minimum satisfiability
• Lower and Upper Bounds for Random Mimimum Satisfiability Problem
• Exact approaches for the diverse satisfiability problem
• Maximum satisfiability formulations for nonlinear integer programming
• Solving weighted maximum satisfiability with branch and bound and clause learning

This page was built for publication: Exact MinSAT Solving

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