🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.lang.prolog
Article #1538

Re: Comprehensive understanding of logic languages

#1538
From: carleton walker `93
Date: Sat, 03 Oct 1992 17:55
23 lines
1412 bytes
In article <92276.202706COMTET@FRECP12.BITNET> <COMTET@FRECP12.BITNET> writes:
>Recently I had courses in languages such as Prolog and Lisp. The beginning of t
>he course was an attempt to describe comprehensively all logic languages. There
>are some terms that I didn't quite understand such as :

>Horner's clause ( or assertion)
>Could somebody give me either the meaning of those words or give me references

	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.

	"Languages have tended to work with Horn clauses because Horn
clauses lead to efficient implementations" (Sethi).

Carl Walker
--
Carl Walker				"Hectic days ahead of us,
Bucknell University			 Rotten ones behind,
Lewisburg, PA				 Keeping plastics in our pockets,
cwalker@canopus.bucknell.edu (! tmc.edu) Children never mind." - K, S, & W
Technical Details
Message-ID: <1akmqnINNihd@coral.bucknell.edu>
Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!uwm.edu!psuvax1!coral.bucknell.edu!canopus!cwalker
References: <92276.202706COMTET@FRECP12.BITNET>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!uwm.edu!psuvax1!coral.bucknell.edu!canopus!cwalker
From: cwalker@canopus.bucknell.edu (carleton walker `93)
Newsgroups: comp.lang.prolog
Subject: Re: Comprehensive understanding of logic languages
Message-ID: <1akmqnINNihd@coral.bucknell.edu>
Date: 3 Oct 92 17:55:35 GMT
Article-I.D.: coral.1akmqnINNihd
References: <92276.202706COMTET@FRECP12.BITNET>
Organization: Bucknell University, Lewisburg, PA
Lines: 23
NNTP-Posting-Host: canopus.cs.bucknell.edu