The Efficiency of Theorem Proving Strategies
A Comparative and Asymptotic Analysis
Published on 13. March 2013
VI, 167 pages
978-3-322-93862-6 (ISBN)
Description
David A. Plaisted ist seit 1984 Professor am Fachbereich Informatik der University of North Carolina. Seine gegenwärtigen Forschungen umfassen automatisches Theorembeweisen, Termersetzungssysteme sowie funktionale und Logikprogrammierung.
Yunshan Zhu ist Mitarbeiter am selben Fachbereich der UNC. Sein Forschungsinteresse gilt dem automatischen Theorembeweisen, formalen Methoden und logikbasierten Methoden der Künstlichen Intelligenz.
Since 1984 David A. Plaisted is professor in the Department of Computer Science at the University of North Carolina. His current interests include theorem proving, term-rewriting systems and logic and functional programming.
Yunshan Zhu also is a member of the Department of Computer Science at the University of North Carolina. Zhu's current research interests include theorem proving, formal methods and logical approaches of Artificial Intelligence.
Yunshan Zhu ist Mitarbeiter am selben Fachbereich der UNC. Sein Forschungsinteresse gilt dem automatischen Theorembeweisen, formalen Methoden und logikbasierten Methoden der Künstlichen Intelligenz.
Since 1984 David A. Plaisted is professor in the Department of Computer Science at the University of North Carolina. His current interests include theorem proving, term-rewriting systems and logic and functional programming.
Yunshan Zhu also is a member of the Department of Computer Science at the University of North Carolina. Zhu's current research interests include theorem proving, formal methods and logical approaches of Artificial Intelligence.
More details
Other editions
Additional editions
David A. Plaisted | Yunshan Zhu
The Efficiency of Theorem Proving Strategies
A Comparative and Asymptotic Analysis
Book
06/1997
Vieweg+Teubner Verlag
€49.95
Article exhausted; check for reprint
Persons
Content
1 The Propositional Complexity of First-Order Theorem Proving Strategies.- 1.1 Introduction.- 1.2 First Order Logic and Refutational Theorem Proving.- 1.3 Search Space Formalism.- 1.4 Measures of Search Duplication.- 1.5 Analysis of Duplication for Various Strategies.- 1.6 Preventing Unit Simplifications.- 1.7 Additional Hard Sets of Clauses.- 1.8 Discussion.- 2 The First-Order Complexity of First-Order Theorem Proving Strategies.- 2.1 Introduction.- 2.2 Proof Complexity measures.- 2.3 Inherent complexities.- 2.4 Inference Based Measures.- 2.5 The Duplication Measure.- 2.6 The Subterm Size Measure.- 2.7 The Linear Size Measure.- 2.8 Sets with Large Literals.- 2.9 Unit Resolvable Clause Sets.- 2.10 Implications for Choice of Strategy.- 2.11 Relations among complexity measures.- 2.12 Conclusions and future work.
