From logic programming to prolog

Provides a systematic introduction to the theory of logic programming and shows how this theory can be applied to reason about pure Prolog programs. The text includes an introduction to programming in Prolog and deals with such programming issues as determination, occur-check freedom and absence of...

Full description

Saved in:
Bibliographic Details
Main Author: Apt, Krzysztof R. 1949- (Author)
Format: Book
Language:English
Published: London New York Prentice Hall 1996
Series:Prentice Hall international series in computer science
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000cam a2200000 i 4500
001 19607
003 MY-KLNDU
005 20241218061455.0
008 221104t19961997nyua |fbi a001 ||engdc
020 |a 013230368X 
039 9 |a 202211041111  |b VLOAD  |c 201507271232  |d faezah  |y 200910091033  |z VLOAD 
040 |a UPNM  |b eng  |c UPNM  |e rda 
090 |a QA 76.63  |b .A67 1996 
100 1 |a Apt, Krzysztof R.  |d 1949-  |e author 
245 1 0 |a From logic programming to prolog  |c Krzysztof R. Apt 
264 1 |a London  |a New York  |b Prentice Hall  |c 1996 
264 4 |c © 1997 
300 |a xviii, 328 pages  |b illustrations  |c 24 cm. 
336 |a text  |2 rdacontent 
337 |a unmediated  |2 rdamedia 
338 |a volume  |2 rdacarrier 
400 0 |a Krzysztof R. Apt 
490 1 |a Prentice Hall international series in computer science 
504 |a Includes bibliographical references and index 
505 0 |a 1. Introduction -- 2. Unification -- 3. Logic Programs: Procedural Interpretation -- 4. Logic Programs: Declarative Interpretation -- 5. Programming in Pure Prolog -- 6. Termination -- 7. The Occur-check Problem -- 8. Partial Correctness -- 9. Programming in Pure Prolog with Arithmetic -- 10. Verification of Pure Prolog Programs with Arithmetic -- 11. Towards Full Prolog 
520 |a Provides a systematic introduction to the theory of logic programming and shows how this theory can be applied to reason about pure Prolog programs. The text includes an introduction to programming in Prolog and deals with such programming issues as determination, occur-check freedom and absence of errors. It covers both the natural interpretations of logic programming, as declarative specification and as procedure for computer execution 
592 |c RM 56.19  |h Perpustakaan ATMA 
650 0 |a Logic programming 
650 0 |a Prolog ( Computer program language ) 
999 |a vtls000020105  |c 19607  |d 19607