Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2080329
- Theory and Applications of Satisfiability Testing
- Computing minimally unsatisfiable subformulas: state of the art and future directions
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- On exact selection of minimally unsatisfiable subformulae
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Theory and Applications of Satisfiability Testing
- Algorithms for computing minimal unsatisfiable subsets of constraints
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Cites work
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- A machine program for theorem-proving
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Algorithms for the maximum satisfiability problem
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- BerkMin: A fast and robust SAT-solver
- Boosting complete techniques thanks to local search methods
- Efficient algorithms for finding critical subgraphs
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Guided local search for solving SAT and weighted MAX-SAT problems
- scientific article; zbMATH DE number 1302170 (Why is no real title available?)
- scientific article; zbMATH DE number 1342119 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Relational concept learning by cooperative evolution
- Solution techniques for the large set covering problem
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(12)- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Minimal sets on propositional formulae. Problems and reductions
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- Minimally unsatisfiable Boolean circuits
- On improving MUS extraction algorithms
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- A new approach to partial MUS enumeration
- scientific article; zbMATH DE number 2080337 (Why is no real title available?)
- Computing minimally unsatisfiable subformulas: state of the art and future directions
- Algorithms for computing minimal equivalent subformulas
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
This page was built for publication: Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037449)
