Publication:2741518
From MaRDI portal
zbMath0990.90534MaRDI QIDQ2741518
Publication date: 24 September 2001
Related Items
On Davis-Putnam reductions for minimally unsatisfiable clause-sets, Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eliminating dublication with the hyper-linking strategy
- An efficient algorithm for the 3-satisfiability problem
- Search algorithms in type theory
- Lemma and cut strategies for propositional model elimination
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving