David A. Plaisted (Open Library)

[Edit][History] last modified september 4, 2008

David A. Plaisted

Books by this Author

	The efficiency of theorem proving strategies by David A. Plaisted Vieweg, 1997
	An exponential lower bound for a restricted class of monotone formulae for 2-unsatisfiability by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1978
	A recursively defined ordering for proving termination of term rewriting systems by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1978
	Inference rules for unsatisfiability by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979
	Theorem proving with abstraction by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979
	An NP-complete matching problem by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979
	Complete problems in the first-order predicate calculus by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979
	The Efficiency of Theorem Proving Strategies by David A. Plaisted, Yunshan Zhu GWV-Vieweg, October 28, 1999 Paperback
	Well-founded orderings for proving termination of systems of rewrite rules by David A. Plaisted Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1978