Books by David A. Plaisted
Efficiency of Theorem Proving Strategies
The efficiency of theorem prov
The efficiency of theorem proving strategies
An NP-complete matching problem
Complete problems in the first-order predicate calculus
Inference rules for unsatisfiability
Restricted oracles
Theorem proving with abstracti
Theorem proving with abstraction
Theorem proving with abstraction, part I
Theorem proving with abstraction, part II
A recursively defined ordering for proving termination of term rewriting systems
An exponential lower bound for a restricted class of monotone formulae for 2-unsatisfiability
Well-founded orderings for proving termination of systems of rewrite rules