Re: To J.W. Lloyd (Foundations of Logic Programming)

Article View: comp.lang.prolog

Article #198

#198

From: Alex Kean
Date: Tue, 14 Apr 1992 20:13

33 lines
1281 bytes

I have a similar problem in 

        "Updating Knowledge Base", 
         New Generation Computing (8) 1990.
         
pp 77-78:

    P2 =     r(X) <- p(X)
             r(X) <- p(X) ^ q(X)

     comp(P2) |= forall (x) p(X) <- q(X)

I presume comp(P2) is program completion (which I know nothing about), then

   r(X) equiv ( p(X) v (p(X)^q(X)) )  |=  forall (x) p(X) <- q(X).

I couldn't figure it out how the above entailment is true.
Maybe I am missing something about program completion, or maybe
something very simple. Please advise.

Thanks,
Best Regards,

Alex Kean <kean@cs.ubc.ca>

Department of Computer Science           
University of British Columbia
6356 Agricultural Road,
Vancouver, British Columbia
Canada V6T 1Z2

Tel: +1 (604)-822-4912
Fax: +1 (604)-822-5485

Technical Details

Message-ID: <1992Apr14.201303.28710@cs.ubc.ca>

Path: arc1-ca.pugleaf.net!sparky!uunet!zephyr.ens.tek.com!uw-beaver!ubc-cs!kean

References: <3716@tuegate.tue.nl> <1992Apr14.164159.11544@menudo.uh.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!zephyr.ens.tek.com!uw-beaver!ubc-cs!kean
From: kean@cs.ubc.ca (Alex Kean)
Newsgroups: comp.lang.prolog
Subject: Re: To J.W. Lloyd (Foundations of Logic Programming)
Message-ID: <1992Apr14.201303.28710@cs.ubc.ca>
Date: 14 Apr 92 20:13:03 GMT
References: <3716@tuegate.tue.nl> <1992Apr14.164159.11544@menudo.uh.edu>
Sender: usenet@cs.ubc.ca (Usenet News)
Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
Lines: 33

Reply to Parent Message