The Efficiency of Theorem Proving Strategies
A Comparative and Asymptotic Analysis
Published on 26. June 1997
Book
Paperback/Softback
VI, 167 pages
978-3-528-05574-5 (ISBN)
Description
Dieses Buch in englischer Sprache widmet sich dem Thema der Effizienz von Beweisstrategien und bietet eine vergleichende und asymptotische Analyse. Das Werk stellt erstmalig asymptotische Schranken für die Größe der von vielen gebräuchlichen Beweisstrategien erzeugten Suchfelder bereit. Auf diese Weise erlaubt es ein theoretisches Verständnis der Effizienz unterschiedlicher Beweisverfahren. Es wird ein fundamental neues Werkzeug für den Effizienzvergleich von Beweisstrategien bereitgestellt.
This book is unique in that it gives asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies. Thus it permits one to gain a theoretical unterstanding of the efficiencies of many different theorem proving methods. This is a fundamental new tool in the comparative study of theorem proving strategies.
This book is unique in that it gives asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies. Thus it permits one to gain a theoretical unterstanding of the efficiencies of many different theorem proving methods. This is a fundamental new tool in the comparative study of theorem proving strategies.
More details
Series
Edition
1997
Language
German
Place of publication
Wiesbaden
Germany
Publishing group
Vieweg & Teubner
Target group
College/higher education
Professional and scholarly
Illustrations
2 s/w Abbildungen
Dimensions
Height: 21 cm
Width: 14.8 cm
ISBN-13
978-3-528-05574-5 (9783528055745)
DOI
10.1007/978-3-322-93862-6
Schweitzer Classification
Other editions
New editions
David A. Plaisted | Yunshan Zhu
The Efficiency of Theorem Proving Strategies
A Comparative and Asymptotic Analysis
Book
10/1999
2nd Edition
Vieweg+Teubner Verlag
€53.49
Shipment within 10-15 days
Additional editions
David A. Plaisted | Yunshan Zhu
The Efficiency of Theorem Proving Strategies
A Comparative and Asymptotic Analysis
E-Book
03/2013
Vieweg+Teubner Verlag
€36.99
Available for download
Persons
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.
Content
Bereitstellung asymptotischer Schranken für die Größe von Suchfeldern der von vielen gebräuchlichen Beweisstrategien erzeugten Suchräume - Gewinnung eines theoretischen Verständnisses der Effizienz unterschiedlicher Beweisverfahren - Effizienzvergleich von Beweisstrategien
Asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies - gaining a theoretical understanding of the efficiencies of many different theorem proving methods - a comparative study of theorem proving strategies
Asymptotic bounds on the sizes of the search spaces generated by many common theorem proving strategies - gaining a theoretical understanding of the efficiencies of many different theorem proving methods - a comparative study of theorem proving strategies