Higher-Order Horn Clauses

Higher-Order Horn Clauses (1990)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gopalan Nadathur , Dale Miller

Venue:	JOURNAL OF THE ACM
Citations:	54 - 19 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Higher-Order Horn Clauses	user correction
AUTHOR NAME	Gopalan Nadathur	user correction
AUTHOR AFFIL	Duke University	user correction
AUTHOR ADDR	Durham, North Carolina 27706	user correction
AUTHOR NAME	Dale Miller	user correction
AUTHOR AFFIL	University of Pennsylvania,	user correction
AUTHOR ADDR	Philadelphia , Pennsylvania	user correction
ABSTRACT	A generalization of Horn clauses to a higher-order logic is described and examined 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 context 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 results have a practical realization in the higher-order logic programming language called λProlog.	user correction
YEAR	1990	INFERENCE
VENUE	JOURNAL OF THE ACM	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	777--814	INFERENCE
VOLUME	37	INFERENCE
CITATIONS	34 found	ParsCit 1.0