Generalizing Core-Guided Max-SAT

DOI10.1007/978-3-642-02777-2_44zbMath1247.68257OpenAlexW1681979991MaRDI QIDQ3637181

Mark H. Liffiton, Karem A. Sakallah

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_44

Mathematics Subject Classification ID

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

Related Items

Fast, flexible MUS enumeration ⋮ A New Approach to Partial MUS Enumeration ⋮ On Improving MUS Extraction Algorithms

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Searching for Autarkies to Trim Unsatisfiable Clause Sets
• Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
• Consistent subsets of inconsistent systems: structure and behaviour
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• On Solving the Partial MAX-SAT Problem