Journal of the ACM Bibliography
Gopalan Nadathur and Dale Miller. Higher-order Horn
clauses. Journal of the ACM, 37(4):777-814, October 1990.
[BibTeX entry]
Categories and Subject Descriptors:
D.3.1 [Programming Languages]: Formal Definitions and
Theory -- syntax; F.4.1 [Mathematical Logic and Formal
Languages]: Mathematical Logic -- logic programming;
I.2.3 [Artificial Intelligence]: Deduction and Theorem
Proving -- logic programming
General Terms:
Languages, Theory
Additional Key Words and Phrases:
Higher-order logic, higher-order unification, Horn clauses, Prolog,
SLD-resolution
Selected papers that cite this one
- Dominic Duggan. Unification with extended
patterns. Theoretical Computer Science, 206(1-2):1-50,
6 October 1998. Fundamental Study.
- James Harland. A proof-theoretic
analysis of goal-directed provability. Journal of Logic and
Computation, 4(1):69-88, February 1994.
- Joshua S. Hodas and Dale Miller. Logic programming in a fragment of
intuitionistic linear logic. Information and
Computation, 110(2):327-365, 1 May 1994.
- Dale Miller. A logic programming
language with lambda-abstraction, function variables, and simple
unification. Journal of Logic and Computation,
1(4):497-536, September 1991.
Selected references
- Krzysztof R. Apt and M. H. Van Emden. Contributions to the theory of logic
programming. Journal of the ACM, 29(3):841-862, July
1982.
- M. H. Van Emden and R. A. Kowalski. The semantics of predicate logic as
a programming language. Journal of the ACM,
23(4):733-742, October 1976.
- Steven Fortune, Daniel Leivant, and Michael O'Donnell. The expressiveness of simple and
second-order type structures. Journal of the ACM,
30(1):151-185, January 1983.
- Gerard P. Huet. The
undecidability of unification in third order logic.
Information and Control, 22(3):257-267, April 1973.
Shortcuts: