Article View: comp.lang.prolog
Article #2223Re: Occurs check
From: Torkel Franzen
Date: Fri, 18 Dec 1992 22:10
Date: Fri, 18 Dec 1992 22:10
13 lines
1231 bytes
1231 bytes
In article <24439@alice.att.com> pereira@alice.att.com (Fernando Pereira) writes: >No, it is not too strong. I think you are confusing deduction in >an interpreted system (eg. Horn clauses over the domain of finite trees, >or of rational trees) with deduction that yields consequences true >in any model, that is, valid consequences. There is no confusion involved. It is merely a matter of "valid consequences of what". The answers yielded by a Prolog system using unification without occurs check are consequences in first order logic of the clauses of the program together with the first order identity theory of rational trees.
Technical Details
Message-ID:
<TORKEL.92Dec18231028@lludd.sics.se>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!sics.se!torkelReferences:
<1992Dec13.173016.8849@nntp.hut.fi> <1992Dec17.111142.24450@dcs.qmw.ac.uk> <24435@alice.att.com> <TORKEL.92Dec17201903@bast.sics.se> <24439@alice.att.com>Show Full Headers
Complete Article Headers
Newsgroups: comp.lang.prolog Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!sics.se!torkel From: torkel@sics.se (Torkel Franzen) Subject: Re: Occurs check In-Reply-To: pereira@alice.att.com's message of 18 Dec 92 15:03:17 GMT Message-ID: <TORKEL.92Dec18231028@lludd.sics.se> Sender: news@sics.se Organization: Swedish Institute of Computer Science, Kista References: <1992Dec13.173016.8849@nntp.hut.fi> <1992Dec17.111142.24450@dcs.qmw.ac.uk> <24435@alice.att.com> <TORKEL.92Dec17201903@bast.sics.se> <24439@alice.att.com> Date: Fri, 18 Dec 1992 22:10:28 GMT Lines: 13