scientific article
From MaRDI portal
Publication:2741514
zbMath0990.90538MaRDI QIDQ2741514
Publication date: 24 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On propositional definability, Simulating circuit-level simplifications on CNF, Unnamed Item, Equivalent literal propagation in the DLL procedure, Failed Literal Detection for QBF, About some UP-based polynomial fragments of SAT, Blocked Clause Elimination for QBF, A parallelization scheme based on work stealing for a class of SAT solvers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallelization scheme based on work stealing for a class of SAT solvers
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A two-phase algorithm for solving a class of hard satisfiability problems
- A constraint-based approach to narrow search trees for satisfiability
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
