🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.lang.prolog
Article #1539

Re: Comprehensive understanding of logic languages

#1539
From: Torkel Franzen
Date: Sat, 03 Oct 1992 18:47
15 lines
1292 bytes
In article <1akmqnINNihd@coral.bucknell.edu> cwalker@canopus.bucknell.edu
 (carleton walker `93) writes:

   >A Horn clause is any rule, fact, or query.
   >Rules have the form A :- B1, B2, ... Bn.
   >Facts have the form A.
   >Queries have the form ?- A.

  "?- A"? What does this mean? Does it have something to do with
logic? Anyway, you left out the information needed for a truly
comprehensive understanding of logic languages. Horn clauses are so
named after Alfred Horn, who showed that theories axiomatizable using
Horn clauses are precisely those whose models are closed under
substructures and direct products. The significance of this fact is
immense, or at any rate not to be sneezed at.
Technical Details
Message-ID: <TORKEL.92Oct3194748@bast.sics.se>
Path: arc1-ca.pugleaf.net!sparky!uunet!math.fu-berlin.de!unidui!rrz.uni-koeln.de!Germany.EU.net!mcsun!sunic!sics.se!torkel
References: <92276.202706COMTET@FRECP12.BITNET> <1akmqnINNihd@coral.bucknell.edu>

Show Full Headers
Complete Article Headers
Newsgroups: comp.lang.prolog
Path: arc1-ca.pugleaf.net!sparky!uunet!math.fu-berlin.de!unidui!rrz.uni-koeln.de!Germany.EU.net!mcsun!sunic!sics.se!torkel
From: torkel@sics.se (Torkel Franzen)
Subject: Re: Comprehensive understanding of logic languages
In-Reply-To: cwalker@canopus.bucknell.edu's message of 3 Oct 1992 17:55:35 GMT
Message-ID: <TORKEL.92Oct3194748@bast.sics.se>
Sender: news@sics.se
Organization: Swedish Institute of Computer Science, Kista
References: <92276.202706COMTET@FRECP12.BITNET> <1akmqnINNihd@coral.bucknell.edu>
Date: Sat, 3 Oct 1992 18:47:48 GMT
Lines: 15