🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Thread View: comp.lang.prolog
3 messages
3 total messages Started by Torkel Franzen Sun, 04 Oct 1992 07:01
More about Horn clauses
#1540
Author: Torkel Franzen
Date: Sun, 04 Oct 1992 07:01
75 lines
3829 bytes
  Since Alfred Horn and preservation theorems are apparently not
universally familiar even among those who subsist largely on a crunchy
diet of Horn clauses, some further remarks are clearly in order.

  Hear ye, hear ye. This is the tale of the Horn clause, as it has come
down to us from the masters of old.

  Preservation theorems were an early development in model theory. The
classical preservation theorems are nice and elementary.

  In mathematics, what is required for a subset G' of a group G to yield
a subgroup? A little reflection tells us that being closed under the group
operation and under inverses will suffice. Associativity and (if we
are talking about Abelian groups) commutativity are taken care of
automatically.

  Similarly with substructures of other kinds of algebraic structures -
fields, linear spaces, and so on. Some of the conditions definining these
structures are automatically satisfied by any subset. What these conditions
have in common is that they can be expressed by purely universal predicate
logic formulas, i.e. formulas

[1]            (x1)...(xn) A(x1,...xn)

where A has no quantifiers. Once we have noted this, it is a simple matter
to prove that all conditions thus expressible are "preserved under
substructures". What this is means is the following:


  T is a theory all axioms of which are purely universal formulas, and
  M is a model of T, then every substructure M' of M is a model of T.


  Now the question inevitably arises whether the converse holds. Or rather,
since theories can be axiomatized in different ways, whether it holds that

  If every substructure of a model of T is a model of T, then T has
  an axiomatization consisting of purely universal formulas.

  The proof of this converse yields the first classical preservation theorem:

  T is preserved under substructures - i.e. every substructure of a model
  of T is itself a model of T - if and only if T has a purely universal
  axiomatization.

  And so it goes on. For every natural way of getting new structures out of
old ones, we try to characterize the theories preserved under that operation.
There are many natural and nice results. For example:


  T is preserved under homomorphic images if and only if T has an
  axiomatization consisting of positive formulas.


  Horn considered a more difficult problem, namely that of preservation
under direct products. The direct product of a (finite or infinite) set of
structures is the generalization of the ordinary direct product of linear
spaces etc.

  Now I don't remember exactly which result Horn formulated (though we have
his original paper somewhere in the archives here at SICS), but as far as
I know there is no natural characterization of the theories preserved under
direct products. However, if we add the condition of being closed under
substructures we get the theorem

   T is preserved under substructures and direct products if and only if
   T has an axiomatization consisting of Horn clauses

where "Horn clause" is the term we now use for formulas of the form [1]
where A is a disjunction of literals (atomic or negated atomic formulas),
at most one of which is atomic.

  (Shoenfield calls them McKinsey formulas, reserving "Horn formulas" for
prenex formulas whose matrix is a conjunction of McKinsey formulas.)
Re: More about Horn clauses
#1609
Author: Olivier Ridoux
Date: Fri, 09 Oct 1992 09:07
37 lines
1999 bytes
From article <TORKEL.92Oct4080150@bast.sics.se>, by torkel@sics.se (Torkel Franzen):
> 
>   Since Alfred Horn and preservation theorems are apparently not
> universally familiar even among those who subsist largely on a crunchy
> diet of Horn clauses, some further remarks are clearly in order.
> 
>   Hear ye, hear ye. This is the tale of the Horn clause, as it has come
> down to us from the masters of old.
> 

Can you, or anybody else, tell us the tale of (hereditary) Harrop
formulas?

Here is why I ask the question:

Horn formulas are a nice start for logic programming because they
yield a so nice model-theoretic denotational semantics, and because
they are so like grammar rules, rewriting rules, production rules,
whatever simple rules.  A major result has not yet been mentioned:
every definable relation can be defined using only Horn formulas.
---> A computer scientist cannot but love them :-)

Harrop formulas are nice for more logic programming because they are a
superset of Horn formulas and they yield a so nice proof-theoretic
operational semantics, and because they are so like sequent calculus
deduction rules, typing rules, whatever less simple rules.  
---> A computer scientist cannot but love them more :-)

There is a model-theoretic semantics for logic programming with Harrop
formulas, also not so nice as for Horn clauses.

This thread started with a beginner asking general questions.  I only
wish we do not give only answers of a fifteen years old state of the
art.  (Fifteen is for logic programming.  For logic it is more, but it
is OK there.)

Olivier Ridoux
Re: More about Horn clauses
#1646
Author: Torkel Franzen
Date: Fri, 16 Oct 1992 20:13
9 lines
905 bytes
In article <1992Oct9.090720.14677@irisa.fr> ridoux@irisa.fr (Olivier Ridoux)
 writes:

   >Can you, or anybody else, tell us the tale of (hereditary) Harrop
   >formulas?

  So what's to tell? Hereditary Harrop formulas are ok, but they have no
ambience. There is nothing sacred about them. Horn clauses are a different
matter!
Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads