A Decision-Making Procedure for Resolution-Based SAT-Solvers
From MaRDI portal
Recommendations
Cites work
- A constraint-based approach to narrow search trees for satisfiability
- A machine program for theorem-proving
- Autarky pruning in propositional model elimination reduces failure redundancy
- BerkMin: A fast and robust SAT-solver
- Boosting complete techniques thanks to local search methods
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- GRASP: a search algorithm for propositional satisfiability
- Investigations on autark assignments
- SATO: An efficient propositional prover
- Solving satisfiability in less than \(2^ n\) steps
- Stochastic local search. Foundations and applications.
- Theory and Applications of Satisfiability Testing
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
Cited in
(10)- Solving SAT problem by heuristic polarity decision-making algorithm
- On the use of autarkies for satisfiability decision
- A Resolution-Based Decision Procedure for $\mathcal{SHOIQ}$
- scientific article; zbMATH DE number 5542984 (Why is no real title available?)
- Boundary Points and Resolution
- An overview of parallel SAT solving
- SAT solving with reference points
- Theory and Applications of Satisfiability Testing
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- Hardware and Software, Verification and Testing
This page was built for publication: A Decision-Making Procedure for Resolution-Based SAT-Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502699)
