Enumerating Infeasibility: Finding Multiple MUSes Quickly

DOI10.1007/978-3-642-38171-3_11zbMath1382.68226OpenAlexW308113020MaRDI QIDQ4922910

Ammar Malik, Mark H. Liffiton

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_11

Mathematics Subject Classification ID

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

Related Items

Fast, flexible MUS enumeration, Memory-limited model-based diagnosis, Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing, A New Approach to Partial MUS Enumeration, Minimal sets on propositional formulae. Problems and reductions, Human-centred feasibility restoration in practice, Stream-based inconsistency measurement, Efficiently Characterizing the Undefined Requests of a Rule-Based System, Debugging unsatisfiable constraint models, BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies, SAT-based rigorous explanations for decision lists