Journal of the ACM Bibliography
David A. Briggs. A correction of
the termination conditions of the Henschen-Naqvi technique.
Journal of the ACM, 37(4):712-719, October 1990.
[BibTeX entry]
Categories and Subject Descriptors:
D.3.4 [Programming Languages]: Processors --
compilers; F.4.1 [Mathematical Logic and Formal
Languages]: Mathematical Logic; H.2.3 [Database
Management]: Languages -- query languages; I.2.3
[Artificial Intelligence]: Deduction and Theorem
Proving
General Terms:
Algorithms, Languages, Theory
Additional Key Words and Phrases:
Cyclic relations, logic and databases, logic program compilation,
recursively defined relations
Selected references
- Gösta Grahne, Seppo Sippu, and Eljas Soisalon-Soininen. Efficient
evaluation for a subset of recursive queries. In Proceedings
of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of
Database Systems, pages 284-293, San Diego, California, 23-25
March 1987.
- Ramsey W. Haddad and Jeffrey F. Naughton. Counting
methods for cyclic relations. In Proceedings of the Seventh
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems, pages 333-340, Austin, Texas, 21-23 March 1988.
- Lawrence J. Henschen and Shamim A. Naqvi. On compiling queries in recursive
first-order databases. Journal of the ACM, 31(1):47-85,
January 1984.
- Jeffrey F. Naughton. Data
independent recursion in deductive databases. In Proceedings
of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database
Systems, pages 267-279, Cambridge, Massachusetts, 24-26 March
1986.
Shortcuts: