home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!sun-barr!ames!elroy.jpl.nasa.gov!sdd.hp.com!think.com!hsdndev!burrhus!generali!mbp
- From: mbp@generali.harvard.edu (Mark B Palmerino)
- Newsgroups: comp.lang.prolog
- Subject: SB-Prolog Tutorial?
- Message-ID: <1992Sep14.185148.13562@burrhus.harvard.edu>
- Date: 14 Sep 92 18:51:48 GMT
- Sender: news@burrhus.harvard.edu (USENET News System)
- Organization: Harvard University, Cambridge, MA
- Lines: 41
-
- I'm just starting the process of learning prolog and have obtained a copy
- of SB-Prolog to experiment with and I have a few questions.
-
- 1. Is there a FAQ for this newsgroup. If yes, where might I find it?
-
- 2. How to efficiently learn?
-
- I've picked up a book entitled "Prolog and Natural-Language Analysis" by
- F. Pereira and S. Shieber and want to work through it. When I compare the
- prolog presented in the book with SB-Prolog there are, understandably,
- differences. For example, the book seems to indicate that one can enter
- facts right into the interpreter as follows:
-
- wrote(terry, shrdlu).
- wrote(bill, lunar).
- etc.
-
- However, the only way I can get facts like this into SB-Prolog is to say:
-
- $assert(wrote(terry, shrdlu)).
-
- On recursion, the book indicates the following:
-
- ancestor(Old, Young) :-
- parent(Old, Young).
- ancestor(Old, Young) :-
- parent(Old, Middle),
- ancestor(Middle, Young).
-
- Well, wrapping these in separate asserts doesn't seem to work. How does
- one define recursion?
-
- Ok, there are differences - that's ok. But what I need is some sane way
- of learning how to use SB-Prolog. Would there be, by any chance, an
- ftp'able tutorial that would get me started?
-
- Thanks so much for your help!
-
- --
- ========================================================================
- Mark Palmerino, Ph.D. mbp@wjh12.harvard.edu Voice: (617) 345-9500
-