Questions about Horn clause

Short answers, pulled from the story.

When did Alfred Horn publish his paper on logical formulas?

Alfred Horn published his paper in 1951. This publication introduced a specific type of disjunctive clause containing at most one positive literal to the field of logic.

What is the difference between a definite clause and a goal clause?

A definite clause contains exactly one positive literal alongside any number of negative literals. A goal clause differs by having zero positive literals and represents a problem statement waiting for a solution.

How does the HORNSAT problem differ from general Boolean satisfiability problems?

The problem of finding truth-value assignments for a conjunction of propositional Horn clauses is known as HORNSAT. Unlike the general Boolean satisfiability problem which is NP-complete, HORNSAT is solvable in linear time.

Who established the foundation for stable model semantics in modern logic programming?

Van Emden and Kowalski published their work on model-theoretic properties in 1976. They showed that every set of definite clauses has a unique minimal model which serves as the foundation for stable model semantics.

Why are Horn clauses essential for early automated reasoning software?

Horn clauses allow mechanical proof generation to run efficiently because the closure property under resolution prevents the explosion of complexity seen in general logic. This efficiency made them essential for early automated reasoning software by reducing computational overhead significantly compared to unrestricted logical forms.