Algorithms for computing minimal unsatisfiable subsets of constraints
From MaRDI portal
Publication:2471741
DOI10.1007/S10817-007-9084-ZzbMATH Open1154.68510OpenAlexW2020169768MaRDI QIDQ2471741
Mark H. Liffiton, Karem A. Sakallah
Publication date: 18 February 2008
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-007-9084-z
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Consistent subsets of inconsistent systems: structure and behaviour
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- A GRASP algorithm to solve the unicost set covering problem
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- An Efficient Algorithm for the Transversal Hypergraph Generation
- Algorithms - ESA 2003
Cited In (64)
- On the query complexity of selecting minimal sets for monotone predicates
- SAT-Based Formula Simplification
- On Improving MUS Extraction Algorithms
- On computing minimal independent support and its applications to sampling and counting
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Counting minimal unsatisfiable subsets
- Speeding up MUS Extraction with Preprocessing and Chunking
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Solving satisfiability problems with preferences
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- Finding Guaranteed MUSes Fast
- Algorithms for computing minimal equivalent subformulas
- Analysing sanity of requirements for avionics systems
- Abstraction for non-ground answer set programs
- Debugging unsatisfiable constraint models
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Shield synthesis
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
- Integrating Topological Proofs with Model Checking to Instrument Iterative Design
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
- Minimal sets on propositional formulae. Problems and reductions
- Binary constraint satisfaction problems defined by excluded topological minors
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
- On Tackling Explanation Redundancy in Decision Trees
- Does This Set of Clauses Overlap with at Least One MUS?
- Measuring inconsistency with constraints for propositional knowledge bases
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
- Responsibility for inconsistency
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems
- Propositional SAT Solving
- On the measure of conflicts: an argumentation-based framework
- Iterative and core-guided maxsat solving: a survey and assessment
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Understanding the complexity of axiom pinpointing in lightweight description logics
- SAT-based rigorous explanations for decision lists
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Strategyproof social choice when preferences and outcomes may contain ties
- Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis
- A New Approach to Partial MUS Enumeration
- Generalizing Core-Guided Max-SAT
- On the minimum consistent subset problem
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- MCS Extraction with Sublinear Oracle Queries
- On semidefinite least squares and minimal unsatisfiability
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Strong inconsistency
- Omission-Based Abstraction for Answer Set Programs
- Certified SAT solving with GPU accelerated inprocessing
- Human-centred feasibility restoration in practice
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting
- Towards an automatic proof of the bakery algorithm
- Accelerating parameter synthesis using semi-algebraic constraints
- Computing MUS-based inconsistency measures
Uses Software
This page was built for publication: Algorithms for computing minimal unsatisfiable subsets of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471741)
