Does This Set of Clauses Overlap with at Least One MUS?

DOI10.1007/978-3-642-02959-2_7zbMath1250.68234OpenAlexW1828246504MaRDI QIDQ5191099

Cédric Piette, Éric Grégoire, Bertrand Mazure

Publication date: 28 July 2009

Published in: Automated Deduction – CADE-22 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases

Uses Software

• MUP

Cites Work

• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Investigations on autark assignments
• Tractable reasoning via approximation
• The universe of propositional approximations
• Local-search extraction of mUSes
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Searching for Autarkies to Trim Unsatisfiable Clause Sets
• Finding Guaranteed MUSes Fast
• Approximate coherence-based reasoning
• Advances in Artificial Intelligence – SBIA 2004
• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel

This page was built for publication: Does This Set of Clauses Overlap with at Least One MUS?