Efficient Combination of Decision Procedures for MUS Computation

DOI10.1007/978-3-642-04222-5_21zbMath1193.68226OpenAlexW1545513444MaRDI QIDQ3655210

Lakhdar Saïs, Youssef Hamadi, Cédric Piette

Publication date: 7 January 2010

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04222-5_21

Mathematics Subject Classification ID

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

Related Items (2)

Algorithms for computing minimal equivalent subformulas ⋮ Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores

Uses Software

• AMUSE
• QUICKXPLAIN

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Finding Guaranteed MUSes Fast
• Tools and Algorithms for the Construction and Analysis of Systems
• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
• Deciding Bit-Vector Arithmetic with Abstraction

This page was built for publication: Efficient Combination of Decision Procedures for MUS Computation