Automated Theorem Proving: A Logical Basis
eBook - PDF

Automated Theorem Proving: A Logical Basis

  1. 418 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Automated Theorem Proving: A Logical Basis

Book details
Table of contents
Citations

About This Book

Automated Theorem Proving: A Logical Basis

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Automated Theorem Proving: A Logical Basis by D.W. Loveland in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Algorithms. We have over one million books available in our catalogue for you to explore.

Information

Publisher
North Holland
Year
2016
ISBN
9781483296777

Table of contents

  1. Front Cover
  2. Automated Theorem Proving: A Logical Basis
  3. Copyright Page
  4. Table of Contents
  5. Dedication
  6. PREFACE
  7. ACKNOWLEDGEMENTS
  8. CHAPTER 1. THE ROLE OF LOGICAL SYSTEMS
  9. CHAPTER 2. BASIC RESOLUTION
  10. CHAPTER 3. REFINEMENTS OF RESOLUTION
  11. CHAPTER 4. SUBSUMPTION
  12. CHAPTER 5. RESOLUTION WITH EQUALITY
  13. CHAPTER 6. RESOLUTION AND PROBLEM REDUCTION FORMAT
  14. APPENDIX: Resolution-based procedures
  15. REFERENCES
  16. TABLE OF SYMBOLS
  17. INDEX