Printed from https://ideas.repec.org/b/spr/sprbok/978-1-4613-0089-2.html
Automated Theorem Proving
Author
Abstract
Individual chapters are listed in the "Chapters" tab
Suggested Citation
DOI: 10.1007/978-1-4613-0089-2
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a for a similarly titled item that would be available.
Book Chapters
The following chapters of this book are listed in IDEAS- Monty Newborn, 2001. "A Brief Introduction to Compile, Herby, and Theo," Springer Books, in: Automated Theorem Proving, chapter 1, pages 1-6, Springer.
- Monty Newborn, 2001. "Predicate Calculus, Well-Formed Formulas, and Theorems," Springer Books, in: Automated Theorem Proving, chapter 2, pages 7-20, Springer.
- Monty Newborn, 2001. "Compile: Transforming Well-Formed Formulas to Clauses," Springer Books, in: Automated Theorem Proving, chapter 3, pages 21-28, Springer.
- Monty Newborn, 2001. "Inference Procedures," Springer Books, in: Automated Theorem Proving, chapter 4, pages 29-42, Springer.
- Monty Newborn, 2001. "Proving Theorems by Constructing Closed Semantic Trees," Springer Books, in: Automated Theorem Proving, chapter 5, pages 43-52, Springer.
- Monty Newborn, 2001. "Resolution-Refutation Proofs," Springer Books, in: Automated Theorem Proving, chapter 6, pages 53-84, Springer.
- Monty Newborn, 2001. "Herby: A Semantic—Tree Theorem Prover," Springer Books, in: Automated Theorem Proving, chapter 7, pages 85-96, Springer.
- Monty Newborn, 2001. "Using Herby," Springer Books, in: Automated Theorem Proving, chapter 8, pages 97-112, Springer.
- Monty Newborn, 2001. "Theo:A Resolution—Refutation Theorem Prover," Springer Books, in: Automated Theorem Proving, chapter 9, pages 113-138, Springer.
- Monty Newborn, 2001. "Using Theo," Springer Books, in: Automated Theorem Proving, chapter 10, pages 139-159, Springer.
- Monty Newborn, 2001. "A Look at the Source Code of Herby," Springer Books, in: Automated Theorem Proving, chapter 11, pages 161-172, Springer.
- Monty Newborn, 2001. "A Look at the Source Code of Theo," Springer Books, in: Automated Theorem Proving, chapter 12, pages 173-180, Springer.
- Monty Newborn, 2001. "The Cade Atp System Competitions and Other Theorem Provers," Springer Books, in: Automated Theorem Proving, chapter 13, pages 181-206, Springer.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprbok:978-1-4613-0089-2. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.