Algorithms for computing minimal unsatisfiable subsets of constraints
From MaRDI portal
(Redirected from Publication:2471741)
Recommendations
Cites work
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- scientific article; zbMATH DE number 1903346 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A GRASP algorithm to solve the unicost set covering problem
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- A machine program for theorem-proving
- An Efficient Algorithm for the Transversal Hypergraph Generation
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
- Consistent subsets of inconsistent systems: structure and behaviour
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(72)- On the query complexity of selecting minimal sets for monotone predicates
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- SAT-Based Formula Simplification
- 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
- Solving satisfiability problems with preferences
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Certified SAT solving with GPU accelerated inprocessing
- Recursive online enumeration of all minimal unsatisfiable subsets
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- Finding Guaranteed MUSes Fast
- Algorithms for computing minimal equivalent subformulas
- Analysing sanity of requirements for avionics systems
- Debugging unsatisfiable constraint models
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Abstraction for non-ground answer set programs
- Shield synthesis
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- Finding boundary elements in ordered sets with application to safety and requirements analysis
- Propositional SAT solving
- Minimal sets on propositional formulae. Problems and reductions
- Binary constraint satisfaction problems defined by excluded topological minors
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Human-centred feasibility restoration in practice
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- On Tackling Explanation Redundancy in Decision Trees
- Measuring inconsistency with constraints for propositional knowledge bases
- Does This Set of Clauses Overlap with at Least One MUS?
- A new approach to partial MUS enumeration
- Enumerating infeasibility: finding multiple MUSes quickly
- Omission-based abstraction for answer set programs
- Tunable online MUS/MSS enumeration
- Responsibility for inconsistency
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Iterative and core-guided maxsat solving: a survey and assessment
- On the measure of conflicts: an argumentation-based framework
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- 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
- Integrating topological proofs with model checking to instrument iterative design
- Speeding up MUS extraction with preprocessing and chunking
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- On improving MUS extraction algorithms
- Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting
- Strategyproof social choice when preferences and outcomes may contain ties
- Generalizing Core-Guided Max-SAT
- Algorithms for Computing Minimal Conflicts
- On the minimum consistent subset problem
- Towards an automatic proof of the bakery algorithm
- Accelerating parameter synthesis using semi-algebraic constraints
- On semidefinite least squares and minimal unsatisfiability
- MCS Extraction with Sublinear Oracle Queries
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Computing MUS-based inconsistency measures
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Restoring CSP satisfiability with MaxSAT
- Strong inconsistency
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)
