Using local search to find MSSes and MUSes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1785006 (Why is no real title available?)
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- On exact selection of minimally unsatisfiable subformulae
- On subclasses of minimal unsatisfiable formulas
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- The complexity of facets resolved
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(14)- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- On the measure of conflicts: Shapley inconsistency values
- MEASURING INCONSISTENCY IN A NETWORK INTRUSION DETECTION RULE SET BASED ON SNORT
- A syntax-based approach to measuring the degree of inconsistency for belief bases
- Finding Guaranteed MUSes Fast
- Using inconsistency measures for estimating reliability
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- A framework for handling logical inconsistencies in the fusion of Boolean knowledge bases
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions
- THE LANDSCAPE OF INCONSISTENCY: A PERSPECTIVE
- On improving MUS extraction algorithms
- On semidefinite least squares and minimal unsatisfiability
- Local-search extraction of mUSes
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction
This page was built for publication: Using local search to find MSSes and MUSes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042194)