The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis (Computational Intelligence) - Softcover

Plaisted, David A.; Zhu, Yunshan

Softcover

ISBN 10: 3528155744 ISBN 13: 9783528155742

Publisher: Vieweg+Teubner Verlag, 1999

Synopsis

A Comparative and Asymptotic Analysis

About this title

About the Author

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.

From the Back Cover

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 tool in the comparative study of theorem proving strategies. The second edition is slightly revised, a few errors have been fixed, and some references to related works have been added.

Edition details

• Publisher: Vieweg+Teubner Verlag
• Publication date: 1999
• Language: English
• ISBN 10: 3528155744
• ISBN 13: 9783528155742
• Binding: Paperback
• Edition number: 2
• Number of pages: 180