Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)
Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)
Resource Information
The item Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 As the 21st century begins, the power of our magical new tool and partner, the computer, is increasing at an astonishing rate. Computers that perform billions of operations per second are now commonplace. Multiprocessors with thousands of little computers  relatively little! can now carry out parallel computations and solve problems in seconds that only a few years ago took days or months. Chessplaying programs are on an even footing with the world's best players. IBM's Deep Blue defeated world champion Garry Kasparov in a match several years ago. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from given facts, or abstractly, to prove theoremsthe subject of this book. Specifically, this book is about two theoremproving programs, THEO and HERBY. The first four chapters contain introductory material about automated theorem proving and the two programs. This includes material on the language used to express theorems, predicate calculus, and the rules of inference. This also includes a description of a third program included with this package, called COMPILE. As described in Chapter 3, COMPILE transforms predicate calculus expressions into clause form as required by HERBY and THEO. Chapter 5 presents the theoretical foundations of seman tic tree theorem proving as performed by HERBY. Chapter 6 presents the theoretical foundations of resolutionrefutation theorem proving as per formed by THEO. Chapters 7 and 8 describe HERBY and how to use it
 Language

 eng
 eng
 Extent
 1 online resource (XIV, 231 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 A brief introduction to COMPILE, HERBY and THEO
 Predicate calculus, wellformed formulas and theorems
 COMPILE: transforming wellformed formulas to clauses
 Inference procedures
 Proving theorems by constructing closed semantic trees
 Resolutionrefutation proofs
 HERBY: A semantic tree theorem prover
 Using HERBY
 THEO: A resolutionrefutation theorem prover
 Using THEO
 A look at HERBY's source code
 A look at THEO's source code
 Other theorem provers
 References
 Isbn
 9781461300892
 Label
 Automated Theorem Proving : Theory and Practice
 Title
 Automated Theorem Proving
 Title remainder
 Theory and Practice
 Statement of responsibility
 by Monty Newborn
 Language

 eng
 eng
 Summary
 As the 21st century begins, the power of our magical new tool and partner, the computer, is increasing at an astonishing rate. Computers that perform billions of operations per second are now commonplace. Multiprocessors with thousands of little computers  relatively little! can now carry out parallel computations and solve problems in seconds that only a few years ago took days or months. Chessplaying programs are on an even footing with the world's best players. IBM's Deep Blue defeated world champion Garry Kasparov in a match several years ago. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from given facts, or abstractly, to prove theoremsthe subject of this book. Specifically, this book is about two theoremproving programs, THEO and HERBY. The first four chapters contain introductory material about automated theorem proving and the two programs. This includes material on the language used to express theorems, predicate calculus, and the rules of inference. This also includes a description of a third program included with this package, called COMPILE. As described in Chapter 3, COMPILE transforms predicate calculus expressions into clause form as required by HERBY and THEO. Chapter 5 presents the theoretical foundations of seman tic tree theorem proving as performed by HERBY. Chapter 6 presents the theoretical foundations of resolutionrefutation theorem proving as per formed by THEO. Chapters 7 and 8 describe HERBY and how to use it
 Cataloging source
 PQKB
 http://library.link/vocab/creatorName
 Newborn, Monty
 Dewey number
 511.3
 Image bit depth
 0
 Language note
 English
 LC call number
 QA8.910.3
 Literary form
 non fiction
 http://library.link/vocab/subjectName

 Mathematics
 Mathematical logic
 Artificial intelligence
 Mathematics
 Mathematical Logic and Foundations
 Mathematical Logic and Formal Languages
 Artificial Intelligence (incl. Robotics)
 Label
 Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 A brief introduction to COMPILE, HERBY and THEO  Predicate calculus, wellformed formulas and theorems  COMPILE: transforming wellformed formulas to clauses  Inference procedures  Proving theorems by constructing closed semantic trees  Resolutionrefutation proofs  HERBY: A semantic tree theorem prover  Using HERBY  THEO: A resolutionrefutation theorem prover  Using THEO  A look at HERBY's source code  A look at THEO's source code  Other theorem provers  References
 Dimensions
 unknown
 Extent
 1 online resource (XIV, 231 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9781461300892
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/9781461300892
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)3400000000091618
 (SSID)ssj0000933625
 (PQKBManifestationID)11576007
 (PQKBTitleCode)TC0000933625
 (PQKBWorkID)10890839
 (PQKB)11019174
 (DEHe213)9781461300892
 (EXLCZ)993400000000091618
 Label
 Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 A brief introduction to COMPILE, HERBY and THEO  Predicate calculus, wellformed formulas and theorems  COMPILE: transforming wellformed formulas to clauses  Inference procedures  Proving theorems by constructing closed semantic trees  Resolutionrefutation proofs  HERBY: A semantic tree theorem prover  Using HERBY  THEO: A resolutionrefutation theorem prover  Using THEO  A look at HERBY's source code  A look at THEO's source code  Other theorem provers  References
 Dimensions
 unknown
 Extent
 1 online resource (XIV, 231 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9781461300892
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/9781461300892
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)3400000000091618
 (SSID)ssj0000933625
 (PQKBManifestationID)11576007
 (PQKBTitleCode)TC0000933625
 (PQKBWorkID)10890839
 (PQKB)11019174
 (DEHe213)9781461300892
 (EXLCZ)993400000000091618
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/AutomatedTheoremProvingTheoryandPractice/tPZDvImBvv0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AutomatedTheoremProvingTheoryandPractice/tPZDvImBvv0/">Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/AutomatedTheoremProvingTheoryandPractice/tPZDvImBvv0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AutomatedTheoremProvingTheoryandPractice/tPZDvImBvv0/">Automated Theorem Proving : Theory and Practice, by Monty Newborn, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>