Using local search to find MSSes and MUSes
From MaRDI portal
Publication:1042194
DOI10.1016/j.ejor.2007.06.066zbMath1176.90410OpenAlexW1998335356MaRDI QIDQ1042194
Bertrand Mazure, Cédric Piette, Éric Grégoire
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.066
Related Items (12)
Using inconsistency measures for estimating reliability ⋮ THE LANDSCAPE OF INCONSISTENCY: A PERSPECTIVE ⋮ MEASURING INCONSISTENCY IN A NETWORK INTRUSION DETECTION RULE SET BASED ON SNORT ⋮ A FRAMEWORK FOR HANDLING LOGICAL INCONSISTENCIES IN THE FUSION OF BOOLEAN KNOWLEDGE BASES ⋮ On the measure of conflicts: Shapley inconsistency values ⋮ A syntax-based approach to measuring the degree of inconsistency for belief bases ⋮ Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases ⋮ Accelerating predicate abstraction by minimum unsatisfiable cores extraction ⋮ On Improving MUS Extraction Algorithms ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions ⋮ Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
Uses Software
Cites Work
- Unnamed Item
- The complexity of facets resolved
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- 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
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
This page was built for publication: Using local search to find MSSes and MUSes
