Path: 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

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