Fast, flexible MUS enumeration
From MaRDI portal
Publication:272009
DOI10.1007/s10601-015-9183-0zbMath1334.90080OpenAlexW2087418187MaRDI QIDQ272009
Alessandro Previti, Mark H. Liffiton, Ammar Malik, João P. Marques-Silva
Publication date: 20 April 2016
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-015-9183-0
Related Items
Progress towards the Holy Grail, Witnesses for Answer Sets of Logic Programs, On Tackling Explanation Redundancy in Decision Trees, Counting minimal unsatisfiable subsets, SAT-Based Formula Simplification, Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing, A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems, Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis, Minimal sets on propositional formulae. Problems and reductions, Understanding the complexity of axiom pinpointing in lightweight description logics, Strategyproof social choice when preferences and outcomes may contain ties, ASP and subset minimality: enumeration, cautious reasoning and MUSes, FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets, On computing probabilistic abductive explanations, Enumeration of minimal models and MUSes in WASP, Unnamed Item, An Automata View to Goal-Directed Methods, Debugging unsatisfiable constraint models, Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds, Unnamed Item, Timed automata relaxation for reachability, BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies, Strong inconsistency, On the complexity of inconsistency measurement, SAT-based rigorous explanations for decision lists
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Generating all maximal models of a Boolean expression
- 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
- Iterative and core-guided maxsat solving: a survey and assessment
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Combining approaches for solving satisfiability problems with qualitative preferences
- On Computing Preferred MUSes and MCSes
- Generalizing Core-Guided Max-SAT
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Identifying Minimally Infeasible Subsystems of Inequalities
- Enumerating Infeasibility: Finding Multiple MUSes Quickly
- Theory and Applications of Satisfiability Testing
- A Modular Approach to MaxSAT Modulo Theories
- Reveal: A Formal Verification Tool for Verilog Designs
- Theory and Applications of Satisfiability Testing
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
