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. Die zweite Auflage wurde gegenüber der ersten leicht verbessert, neuere Literaturhinweise zudem berücksichtigt. 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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Book Description
A Comparative and Asymptotic Analysis
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.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
The efficiency of a theorem prover is more directly influenced by the total number of inferences performed before a proof is found than by the size of the final proof. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
linking refutation, binary resolution proof, double exponential number, duplication measure, problem reduction format, unsatisfiable clause sets, proof length measure, duplication complexity, exponential complexity with respect, exponential duplication, propositional satisfiability test, single exponential complexity, linking proofs, clause linking, proof dags, unit simplification, theorem proving strategies, exponential with respect, polynomial behavior, subsumption deletion, double exponential complexity, minimal unsatisfiable, factoring operation, reduction formats, backward chaining methods New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
The efficiency of a theorem prover is more directly influenced by the total number of inferences performed before a proof is found than by the size of the final proof. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
linking refutation, binary resolution proof, double exponential number, duplication measure, problem reduction format, unsatisfiable clause sets, proof length measure, duplication complexity, exponential complexity with respect, exponential duplication, propositional satisfiability test, single exponential complexity, linking proofs, clause linking, proof dags, unit simplification, theorem proving strategies, exponential with respect, polynomial behavior, subsumption deletion, double exponential complexity, minimal unsatisfiable, factoring operation, reduction formats, backward chaining methods New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 9
books:
See all 9 books this book cites
1
book
cites this book:
- Artificial Intelligence by W. (ed) Bibel in Back Matter (1), and Back Matter (2)
- Automated Theorem Proving (Artificial Intelligence) by Wolfgang Bibel in Front Matter, and Back Matter
- Artificial Intelligence by A. E. Nisenfedl in Back Matter
- Foundations of Logic Programming (Symbolic Computation : Artificial Intelligence) by John Wylie Lloyd in Back Matter
- Automated Reasoning: Introduction and Applications by Larry Wos in Back Matter
See all 9 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
