|
|
|
|
| LEADER |
01746nam a2200217 a 4500 |
| 001 |
497146 |
| 005 |
20171111225924.0 |
| 008 |
940816s1994 gw a 001 0 eng |
| 020 |
|
|
|a 0387583505
|
| 050 |
|
|
|a 3540583505 (Berlin)
|b C57 1994
|a QA76.73.P76
|
| 082 |
|
|
|2 20
|a 005.13/3
|
| 100 |
1 |
|
|a Clocksin, W. F.
|d 1955-
|q (William F.),
|
| 245 |
1 |
|
|a Programming in Prolog /
|c W.F. Clocksin, C.S. Mellish.
|
| 250 |
1 |
|
|a 4th ed.
|
| 260 |
1 |
|
|a Berlin ;
|b Springer-Verlag,
|c c1994.
|a New York :
|
| 300 |
1 |
|
|a xiv, 281 p. :
|b ill. ;
|c 24 cm.
|
| 504 |
1 |
|
|a Includes bibliographical references and index.
|
| 505 |
1 |
|
|a Ch. 1. Gives the student a "feel" for what it is like to program inProlog. Introduces objects, relationships, facts, rules, variables --Ch. 2. More detailed presentation of Prolog syntax and data structures-- Ch. 3. Representing objects and relationships by using "trees" and"lists". Developing several standard Prolog programming techniques --Ch. 4. How a set of clauses generates a set of solutions. Using "cut"to modify the control sequence of running Prolog programs -- Ch. 5.Facilities available for the input and output of characters andstructures. Developing a program to read sentences from the user andrepresent the sentence as a list of words, which can be used with theGrammar Rules of Chapter 9 -- Ch. 6. Definition of the "core" built-inpredicates, with sensible examples of how each one is used. By thispoint, the reader should be able to read reasonably complex programs,and should therefore be able to absorb the built-in predicates byseeing them in use.
|
| 650 |
1 |
|
|a Prolog (Computer program language)
|
| 700 |
1 |
|
|a Mellish, C. S.
|q (Christopher S.),
|
| 952 |
|
|
|a GrThPMO
|b 59afe0d16c5ad17d7e59ef0e
|c 952a
|d 9528
|e QA76.73.P76C57 1994
|t 7
|x m
|z Books
|
