Explanations of unsatisfiability beyond minimal subsets
From MaRDI portal
Cites work
- A new index of power for simple n-person games
- A theory of diagnosis from first principles
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Approaches to Diagnosing Infeasible Linear Programs
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas
- Classifications for inconsistent theories
- Comparison of SAT-based and ASP-based algorithms for inconsistency measurement
- Computational Aspects of Cooperative Game Theory
- Computing maximal autarkies with few and simple oracle queries
- Computing MUS-based inconsistency measures
- Consistent subsets of inconsistent systems: structure and behaviour
- Counting minimal unsatisfiable subsets
- Enumerating infeasibility: finding multiple MUSes quickly
- Fast, flexible MUS enumeration
- Finding a collection of MUSes incrementally
- Hashing-based approximate counting of minimal unsatisfiable subsets
- scientific article; zbMATH DE number 4145701 (Why is no real title available?)
- scientific article; zbMATH DE number 1470897 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Improving MCS enumeration via caching
- Inconsistency measurement based on variables in minimal unsatisfiable subsets
- Inconsistency tolerance.
- Irreducibly inconsistent systems of linear inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Mathematical Properties of the Banzhaf Power Index
- MCS Extraction with Sublinear Oracle Queries
- Measuring inconsistency
- Minimal sets on propositional formulae. Problems and reductions
- On computing preferred MUSes and MCSes
- On computing the union of MUSes
- On efficient computation of variable MUSes
- On the measure of conflicts: Shapley inconsistency values
- Polynomial calculation of the Shapley value based on sampling
- PySAT: a Python toolkit for prototyping with SAT oracles
- Redundancy in logic. I: CNF propositional formulae
- Rotation based MSS/MCS enumeration
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- The complexity of theorem-proving procedures
- Theory and Applications of Models of Computation
- Towards efficient MUS extraction
This page was built for publication: Explanations of unsatisfiability beyond minimal subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884717)
