Combining preorder and postorder resolution in a satisfiability solver
From MaRDI portal
Recommendations
- Resolution and the integrality of satisfiability problems
- A synthesis of constraint satisfaction and constraint solving
- A Preprocessor for Max-SAT Solvers
- scientific article; zbMATH DE number 5542984
- A gentle non-disjoint combination of satisfiability procedures
- Resolution with order and selection for hybrid logics
- Combining approaches for solving satisfiability problems with qualitative preferences
- scientific article; zbMATH DE number 1979549
- Compositional satisfiability solving in separation logic
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- An efficient algorithm for the 3-satisfiability problem
- Eliminating dublication with the hyper-linking strategy
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 1487978 (Why is no real title available?)
- scientific article; zbMATH DE number 956861 (Why is no real title available?)
- scientific article; zbMATH DE number 956865 (Why is no real title available?)
- Lemma and cut strategies for propositional model elimination
- Search algorithms in type theory
Cited in
(4)
This page was built for publication: Combining preorder and postorder resolution in a satisfiability solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741518)
