MCS Extraction with Sublinear Oracle Queries
From MaRDI portal
Publication:2818026
DOI10.1007/978-3-319-40970-2_21zbMath1475.68220OpenAlexW2474246643MaRDI QIDQ2818026
Carlos Mencía, Alessandro Previti, Alexey Ignatiev, João P. Marques-Silva
Publication date: 5 September 2016
Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40970-2_21
Related Items
On Tackling Explanation Redundancy in Decision Trees, Minimal sets on propositional formulae. Problems and reductions, Model enumeration in propositional circumscription via unsatisfiable core analysis, Efficient Reasoning for Inconsistent Horn Formulae, SAT-based rigorous explanations for decision lists
Uses Software
Cites Work
- Unnamed Item
- On the query complexity of selecting minimal sets for monotone predicates
- Generating all maximal models of a Boolean expression
- Solving satisfiability problems with preferences
- A theory of diagnosis from first principles
- Nonmonotonic reasoning: From complexity to algorithms
- On computing minimal models
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Towards efficient MUS extraction
- Combining approaches for solving satisfiability problems with qualitative preferences
- On Computing Preferred MUSes and MCSes
- Computing Maximal Autarkies with Few and Simple Oracle Queries
- Generating Corrective Explanations for Interactive Constraint Satisfaction
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Consistent subsets of inconsistent systems: structure and behaviour
- Theory and Applications of Satisfiability Testing
