On improving MUS extraction algorithms
From MaRDI portal
Recommendations
Cites work
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Finding Guaranteed MUSes Fast
- Generalizing Core-Guided Max-SAT
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Local-search extraction of mUSes
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- On exact selection of minimally unsatisfiable subformulae
- Redundancy in logic. I: CNF propositional formulae
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Using local search to find MSSes and MUSes
Cited in
(33)- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Minimal sets on propositional formulae. Problems and reductions
- On exact selection of minimally unsatisfiable subformulae
- SAT-based rigorous explanations for decision lists
- Assessing progress in SAT solvers through the Lens of incremental SAT
- SAT-based explicit LTL reasoning and its application to satisfiability checking
- Local-search extraction of mUSes
- Algorithms for computing minimal unsatisfiable subsets of constraints
- On efficient computation of variable MUSes
- Minimally unsatisfiable Boolean circuits
- Restoring CSP satisfiability with MaxSAT
- Towards efficient MUS extraction
- On computing preferred MUSes and MCSes
- MUSer2: an efficient MUS extractor
- Speeding up MUS extraction with preprocessing and chunking
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Efficient combination of decision procedures for MUS computation
- Algorithms for computing minimal equivalent subformulas
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Towards backbone computing: a greedy-whitening based approach
- MUPS identification based on discrimination rules
- Formula preprocessing in MUS extraction
- Parallel MUS extraction
- Factoring Out Assumptions to Speed Up MUS Extraction
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Multi-objective maximum satisfiability by single-objective implicit hitting set optimization
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
This page was built for publication: On improving MUS extraction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007681)
