raghu@speedy.cs.wisc.edu (Raghu Ramakrishnan) (04/07/88)
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