Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!udel!gatech!swrinde!ihnp4.ucsd.edu!munnari.oz.au!cs.mu.OZ.AU!munta.cs.mu.OZ.AU!lee
From: lee@munta.cs.mu.OZ.AU (Lee Naish)
Subject: Re: Hard Prolog Questions
Message-ID: <9503912.17878@mulga.cs.mu.OZ.AU>
Sender: news@cs.mu.OZ.AU (CS-Usenet)
Organization: Department of Computer Sci, University of Melbourne
References: <3gtma1$1bn@mozo.cc.purdue.edu>
Date: Wed, 8 Feb 1995 01:22:06 GMT
Lines: 15

In article <3gtma1$1bn@mozo.cc.purdue.edu> helz@ecn.purdue.edu (Randall A Helzerman) writes:
>
>1.  Suppose I have a logic program P.  Further suppose that no clause in
>    P can be derived from any other clause in P using resolution. 
>    Is it possible for there to be another logic program Q such that
>    Q is smaller than P but yet they both have the same Least Herbrand
>    Model?

How about P = {p:-p} Q = {}

>2.  (This is just a reality-check)

Your reality and my reality agree on this point.

	lee
