Books by David A. Plaisted
Total count: 11
An exponential lower bound for a restricted class of monotone formulae for 2-unsatisfiabilityDept. of Computer Science, University of Illinois at Urbana-Champaign1978-01-01
A recursively defined ordering for proving termination of term rewriting systemsDept. of Computer Science, University of Illinois at Urbana-Champaign1978-01-01
Inference rules for unsatisfiabilityDept. of Computer Science, University of Illinois at Urbana-Champaign1979-01-01
Theorem proving with abstraction, part IDept. of Computer Science, University of Illinois at Urbana-Champaign1979-01-01
Theorem proving with abstraction, part IIDept. of Computer Science, University of Illinois at Champaign-Urbana1979-01-01
Restricted oraclesDept. of Computer Science, University of Illinois at Urbana-Champaign1979-01-01
An NP-complete matching problemDept. of Computer Science, University of Illinois at Urbana-Champaign1979-01-01
Complete problems in the first-order predicate calculusDept. of Computer Science, University of Illinois at Urbana-Champaign1979-01-01
The Efficiency of Theorem Proving StrategiesA Comparative and Asymptotic Analysis (Computational Intelligence)2 editionGWV-Vieweg1999-10-28