Horn Clauses and Feature-Structure Logic: Principles and Unification Algorithms
Stephen J. Hegner · 2001
The desirability of Horn clauses in logical deductive systems has long been recognized. The reasons are at least threefold. Firstly, while inference algorithms for full logics of any reasonable extent are typically intractable, for systems restricted to Horn clauses the picture is much better. (For example, in ordinary propositional logic, while the full satisfiability problem is NP-complete, a linear-time algorithm exists for Horn clauses.) Secondly, the knowledge-representation capabilities of Horn clauses, while weaker than those of the full logic, remain remarkably rich; indeed, far richer than that of simple conjunctive logic alone. Thirdly, Horn clauses define the maximal subset of a full logic which has the property of admitting generic models, which roughly means that for any set of Horn clauses, there is a least model of the clauses in that set. It is the purpose of this paper to initiate an investigation of Horn clause logic for an extended class of feature structures. After...