MUST: Provide a Finer-Grained Explanation of Unsatisfiability

DOI10.1007/978-3-540-74970-7_24zbMath1145.68516OpenAlexW1562908040MaRDI QIDQ3523066

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

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

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

zbMATH Keywords

MUSexplanationCSPconstraint networksMUCunsatisfiabilityMUST

Mathematics Subject Classification ID

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

Related Items (6)

Progress towards the Holy Grail ⋮ Super-reparametrizations of weighted CSPs: properties and optimization perspective ⋮ On getting rid of the preprocessing minimization step in MUC-finding algorithms ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Algorithms for computing minimal equivalent subformulas ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance

Uses Software

• Choco
• AMUSE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choco
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Local-search extraction of mUSes
• Generalized filtering algorithms for infeasibility analysis
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

This page was built for publication: MUST: Provide a Finer-Grained Explanation of Unsatisfiability