Local-search extraction of mUSes
DOI10.1007/S10601-007-9019-7zbMATH Open1211.90307OpenAlexW2073776354WikidataQ126254226 ScholiaQ126254226MaRDI QIDQ2385174FDOQ2385174
Authors: E. Grégoire, Bertrand Mazure, Cedric Piette 
Publication date: 11 October 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-007-9019-7
Recommendations
- Using local search to find MSSes and MUSes
- Towards efficient MUS extraction
- Finding a collection of MUSes incrementally
- On improving MUS extraction algorithms
- MUSer2: an efficient MUS extractor
- On computing the union of MUSes
- Mechanisms for local search
- Maxima units search (MUS) algorithm: methodology and applications
- Local search algorithms for the composite retrieval problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- The complexity of facets resolved
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- A machine program for theorem-proving
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On subclasses of minimal unsatisfiable formulas
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- On exact selection of minimally unsatisfiable subformulae
- Boosting complete techniques thanks to local search methods
- Checking depth-limited consistency and inconsistency in knowledge-based systems
- Title not available (Why is that?)
Cited In (12)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Resolution proof transformation for compression and interpolation
- Finding Guaranteed MUSes Fast
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A framework for handling logical inconsistencies in the fusion of Boolean knowledge bases
- Does This Set of Clauses Overlap with at Least One MUS?
- Efficient combination of decision procedures for MUS computation
- An approach for extracting a small unsatisfiable core
- Using local search to find MSSes and MUSes
- THE LANDSCAPE OF INCONSISTENCY: A PERSPECTIVE
- On improving MUS extraction algorithms
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
Uses Software
This page was built for publication: Local-search extraction of mUSes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385174)
