A Preprocessor for Max-SAT Solvers

DOI10.1007/978-3-540-79719-7_2zbMath1138.68532OpenAlexW1889633121MaRDI QIDQ3502688

Felip Manyà, Chu-Min Li, Josep Argelich

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_2

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Exact Max-SAT solvers for over-constrained problems
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
• Local Consistency in Weighted CSPs and Inference in Max-SAT
• Theory and Applications of Satisfiability Testing
• On Solving the Partial MAX-SAT Problem
• A Complete Calculus for Max-SAT

This page was built for publication: A Preprocessor for Max-SAT Solvers