Niveau: Supérieur, Doctorat, Bac+8
HIGHER-ORDER HORN CLAUSES GOPALAN NADATHUR Duke University, Durham, North Carolina DALE MILLER University of Pennsylvania, Philadelphia, Pennsylvania Abstract: A generalization of Horn clauses to a higher-order logic is described and ex- amined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first-order ones by replacing first-order terms with simply typed ?-terms and by permitting quantification over all occurrences of function symbols and some occurrences of predicate symbols. Several proof-theoretic results concerning these extended clauses are presented. One result shows that although the substitutions for predicate variables can be quite complex in general, the substitutions necessary in the con- text of higher-order Horn clauses are tightly constrained. This observation is used to show that these higher-order formulas can specify computations in a fashion similar to first-order Horn clauses. A complete theorem proving procedure is also described for the extension. This procedure is obtained by interweaving higher-order unification with backchaining and goal reductions, and constitutes a higher-order generalization of SLD-resolution. These re- sults have a practical realization in the higher-order logic programming language called ?Prolog. Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Defi- nitions and Theory — syntax; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic — logic programming; I.
- quantification over
- theoretic discussions
- predicate variable
- interweaves higher
- programming
- logic programming
- higher-order logic
- order horn
- various higher order