Enumerating Infeasibility: Finding Multiple MUSes Quickly
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 160-175
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- MUSer2: An Efficient MUS Extractor1Journal on Satisfiability, Boolean Modeling and Computation, 2012
- NMUS: Structural Analysis for Improving the Derivation of All MUSes in Overconstrained Numeric CSPsLecture Notes in Computer Science, 2007
- On Solving the Partial MAX-SAT Problem2006
- Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization2005
- An Extensible SAT-solver2004
- Finding all minimal unsatisfiable subsets2003
- Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principlesIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1999
- A theory of measurement in diagnosis from first principlesArtificial Intelligence, 1994
- Identifying Minimally Infeasible Subsystems of InequalitiesINFORMS Journal on Computing, 1990
- Diagnosing multiple faultsArtificial Intelligence, 1987