From logic to logic programming

Saved in:
Bibliographic Details
Main Author: Doets, Kees.
Format: eBook
Language: English
Published: Cambridge, Mass. : MIT Press, c1994.
Series: Foundations of computing.
Subjects:
Logic programming.
elektronické knihy
electronic books
ISBN: 9780262288477
Physical Description: 1 online zdroj (xii, 214 p.) : ill.

Cover

Table of contents

LEADER 02726cam a2200349 a 4500
001 75024
003 CZ ZlUTB
005 20240911212406.0
006 m d
007 cr un
008 130208s1994 maua sb 011 0 eng d
020 |a 9780262288477  |q (ebook) 
035 |a (OCoLC)827013098 
040 |a IEEEE  |c IEEEE  |d OCLCF 
100 1 |a Doets, Kees. 
245 1 0 |a From logic to logic programming  |h [elektronický zdroj] /  |c Kees Doets. 
260 |a Cambridge, Mass. :  |b MIT Press,  |c c1994. 
300 |a 1 online zdroj (xii, 214 p.) :  |b ill. 
490 1 |a Foundations of computing 
504 |a Includes bibliographical references (p. [197]-199) and index. 
505 0 |a 1. Preliminaries. 1.1. Mathematical Induction. 1.2. Trees. 1.3. Multisets. 1.4. Ordinals and Cardinals -- 2. Propositional Logic. 2.1. Syntax. 2.2. Semantics. 2.3. Conjunctive Normal Form. 2.4. Resolution -- 3. First-order Logic. 3.1. Introduction. 3.2. Syntax. 3.3. Semantics. 3.4. Quantifier-free Sentences. 3.5. Universal Sentences. 3.6. Prenex and Skolem Forms. 3.7. Resolution: The Unrestricted Version. 3.8. Unification. 3.9. Resolution -- 4. Program-definability. 4.1. Programs. 4.2. The Least Herbrand Model. 4.3. Fixed Points. 4.4. Hierarchies. 4.5. Definability. 4.6. Representing Domains as Herbrand Universes -- 5. Linear Resolution. 5.1. Preliminaries. 5.2. Unrestricted Linear Resolution. 5.3. Ground Completeness. 5.4. Linear Resolution. 5.5. SLD-Resolution -- 6. Infinite Derivations. 6.1. Negative Information. 6.2. Non-standard Algebras. 6.3. Resolution over Non-standard Algebras. 6.4. Realization Trees. 6.5. The Interplay of SLD-trees and Realization Trees -- 7. Computability. 7.1. Preliminaries. 
505 0 |a 7.2. Computability of Recursive Functions. 7.3. Complexity of T[subscript p][actual symbol not reproducible] -- 8. Negation. 8.1. Introduction. 8.2. Negation Implemented: SLDNF. 8.3. 3-Valued Models. 8.4. 3-Valued Consequence Operator. 8.5. Soundness. 8.6. Saturation. 8.7. Completeness for SLDNF. 
506 |a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty univerzity 
650 0 |a Logic programming. 
655 7 |a elektronické knihy  |7 fd186907  |2 czenas 
655 9 |a electronic books  |2 eczenas 
776 0 8 |i Print version:  |a Doets, Kees.  |t From logic to logic programming.  |d Cambridge, Mass. : MIT Press, c1994  |z 0262041421  |w (DLC) 93006196  |w (OCoLC)28666357 
830 0 |a Foundations of computing. 
856 4 0 |u https://proxy.k.utb.cz/login?url=http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267470  |y Plný text 
992 |a BK  |c EBOOK-TN  |c MITPRESS 
999 |c 75024  |d 75024 
993 |x NEPOSILAT  |y EIZ 

Similar Items