A New Approach to Partial MUS Enumeration
From MaRDI portal
Publication:3453242
DOI10.1007/978-3-319-24318-4_28zbMath1471.68176OpenAlexW2260113441MaRDI QIDQ3453242
Christian Zielke, Michael Kaufmann
Publication date: 20 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_28
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Diagnosing multiple faults
- A theory of diagnosis from first principles
- Irreducibly inconsistent systems of linear inequalities
- A theory of measurement in diagnosis from first principles
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Towards efficient MUS extraction
- An Efficient Algorithm for the Transversal Hypergraph Generation
- Generalizing Core-Guided Max-SAT
- Approaches to Diagnosing Infeasible Linear Programs
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Consistent subsets of inconsistent systems: structure and behaviour
- Enumerating Infeasibility: Finding Multiple MUSes Quickly
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
