|
|
|
|
LEADER |
00000cam a2200000Ia 4500 |
001 |
SCIDIR_ocn898422462 |
003 |
OCoLC |
005 |
20231117044432.0 |
006 |
m o d |
007 |
cr cnu---unuuu |
008 |
141220s1978 ne ob 001 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCO
|d N$T
|d OCLCQ
|d OCLCE
|d OCLCF
|d OPELS
|d YDXCP
|d DEBSZ
|d OCLCQ
|d MERUC
|d IDB
|d OCLCQ
|d UKAHL
|d OCLCQ
|d VLY
|d OCLCO
|d S2H
|d OCLCO
|d COM
|d OCLCO
|d OCLCQ
|
019 |
|
|
|a 654252472
|
020 |
|
|
|a 9781483296777
|q (electronic bk.)
|
020 |
|
|
|a 1483296776
|q (electronic bk.)
|
020 |
|
|
|a 0720404991
|
020 |
|
|
|a 9780720404999
|
035 |
|
|
|a (OCoLC)898422462
|z (OCoLC)654252472
|
050 |
|
4 |
|a QA76.9.A96
|
072 |
|
7 |
|a MAT
|x 000000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.36028563
|2 23
|
100 |
1 |
|
|a Loveland, Donald W.
|
245 |
1 |
0 |
|a Automated theorem proving :
|b a logical basis /
|c Donald W. Loveland.
|
260 |
|
|
|a Amsterdam ;
|a New York :
|b North-Holland Pub. Co. ;
|a New York :
|b Sole distributor for the U.S.A. and Canada, Elsevier North-Holland,
|c 1978.
|
300 |
|
|
|a 1 online resource
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Fundamental studies in computer science ;
|v volume 6
|
504 |
|
|
|a Includes bibliographical references and index.
|
588 |
0 |
|
|a Online resource; title from PDF title page (EBSCO, viewed December 30, 2014).
|
505 |
0 |
|
|a Front Cover; Automated Theorem Proving: A Logical Basis; Copyright Page; Dedication; PREFACE; Table of Contents; ACKNOWLEDGEMENTS; CHAPTER 1. THE ROLE OF LOGICAL SYSTEMS; 1.1. Orientation; 1.2. The basic concepts of first-order logic; 1.3. The formal presentation of problems; 1.4. Refutation procedures; 1.5. Preparation of formulas; 1.6. The Herbrand Theorem; 1.7. Summary; CHAPTER 2. BASIC RESOLUTION; 2.1. Introduction; 2.2. The Davis-Putnam Procedure; 2.3. Ground resolution; 2.4. Semantic Trees; 2.5. General resolution: Unification; 2.6. The general resolution procedure; 2.7. Summary
|
505 |
8 |
|
|a CHAPTER 3. REFINEMENTS OF RESOLUTION3.1. Introduction; 3.2. Unit preference and set-of-support; 3.3. Ordered clause deductions; 3.4. Setting refinements; 3.5. Linear refinements; 3.6. Model elimination; 3.7. Summary; CHAPTER 4. SUBSUMPTION; 4.1. Subsumption for nonlinear procedures; 4.2. Subsumption for linear procedures; 4.3. Summary; CHAPTER 5. RESOLUTION WITH EQUALITY; 5.1. Paramodulation; 5.2. Paramodulation and setting refinements; 5.3. Paramodulation and linear refinements; 5.4. Summary; CHAPTER 6. RESOLUTION AND PROBLEM REDUCTION FORMAT; 6.1. The problem reduction format
|
505 |
8 |
|
|a 6.2. The ME procedure and problem reduction6.3. Summary; APPENDIX: Resolution-based procedures; REFERENCES; TABLE OF SYMBOLS; INDEX
|
520 |
|
|
|a Automated Theorem Proving: A Logical Basis.
|
650 |
|
0 |
|a Automatic theorem proving.
|
650 |
|
6 |
|a Th�eor�emes
|x D�emonstration automatique.
|0 (CaQQLa)201-0031979
|
650 |
|
7 |
|a MATHEMATICS
|x General.
|2 bisacsh
|
650 |
|
7 |
|a Automatic theorem proving.
|2 fast
|0 (OCoLC)fst00822777
|
650 |
|
7 |
|a Beweistheorie
|2 gnd
|0 (DE-588)4145177-6
|
776 |
0 |
8 |
|i Print version:
|a Loveland, D.W.
|t Automated Theorem Proving: A Logical Basis.
|d Burlington : Elsevier Science, �2014
|z 9780720404999
|
830 |
|
0 |
|a Fundamental studies in computer science ;
|v v. 6.
|
856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9780720404999
|z Texto completo
|