Article View: comp.lang.prolog
Article #3215Declarative Prolog programs
From: Raghu Ramakrishnan
Date: Thu, 07 Apr 1988 05:23
Date: Thu, 07 Apr 1988 05:23
20 lines
900 bytes
900 bytes
This is a request for information about the kinds of programs that you typically write in Prolog. I am interested in: (1) Programs that are declarative, or contain significant declarative fragments. (2) Programs that use backtracking in an essential way, or are hard to write purely declaratively. (I'd prefer examples without cuts, negation, and extra-logical operators.) By declarative, I mean that all - and, of course, only - answers implied by the lfp semantics are computed. Any programs or comments would be appreciated. Raghu Ramakrishnan raghu@cs.wisc.edu
Technical Details
Message-ID:
<5528@spool.cs.wisc.edu>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!oddjob!uwvax!speedy!raghuShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!oddjob!uwvax!speedy!raghu From: raghu@speedy.cs.wisc.edu (Raghu Ramakrishnan) Newsgroups: comp.lang.prolog Subject: Declarative Prolog programs Message-ID: <5528@spool.cs.wisc.edu> Date: 7 Apr 88 05:23:59 GMT Sender: news@spool.cs.wisc.edu Distribution: comp Lines: 20