Horn clause

From Wikipedia, the free encyclopedia

In logic, a Horn clause is a clause (a disjunction of literals) with at most one positive literal. They are named for the logician Alfred Horn, who first pointed out the significance of such clauses in 1951, in the article "On sentences which are true of direct unions of algebras", Journal of Symbolic Logic, 16, 14-21.

A Horn clause with exactly one positive literal is a definite clause; a Horn clause with no positive literals is sometimes called a goal clause, especially in logic programming. A Horn formula is a conjunctive normal form formula whose clauses are all Horn; in other words, it is a conjunction of Horn clauses. A dual-Horn clause is a clause with at most one negative literal. Horn clauses play a basic role in logic programming and are important for constructive logic.

The following is an example of a (definite) Horn clause:

$\neg p \or \neg q \vee \cdots \vee \neg t \vee u$

Such a formula can also be written equivalently in the form of an implication:

$(p \wedge q \wedge \cdots \wedge t) \rightarrow u$

The relevance of Horn clauses to theorem proving by first-order resolution is that the resolution of two Horn clauses is a Horn clause. Moreover, the resolution of a goal clause and a definite clause is again a goal clause. In automated theorem proving, this can lead to greater efficiencies in proving a theorem (represented as a goal clause).

In fact, the resolution of a goal clause with a definite clause to produce a new goal clause is the basis of logic programming and the programming language Prolog. In logic programming a definite clause behaves as a goal-reduction procedure. For example, the Horn clause written above behaves as the procedure:

to show $u$ , show $p$ and show $q$ and $\cdots$ and show $t$ .

To emphasize this backwards use of the clause, it is often written using the consequence operator:

$u \leftarrow (p \and q \and \cdots \and t)$

Horn clauses are also of interest in computational complexity, where the problem of finding a set of variable assignments to make a conjunction of Horn clauses true is a P-complete problem, sometimes called HORNSAT. This is P's version of the boolean satisfiability problem, a central NP-complete problem.