A note on fixpoint techniques in database recursive logic programs. (English) Zbl 0647.68110

We show how to use fixed point techniques to answer some nonlinear recursive queries, by transforming such queries into left-linear (or regular) queries having the same solutions, and which can be answered via a while loop.


68P20 Information storage and retrieval of data
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
Full Text: DOI EuDML


[1] 1. A. V. AHO and J. D. ULLMAN, Universality of Data Retrieval Languages, Proc. Sixth A.C.M. Symp. on principles of programming languages, San Antonio, 1979, pp. 110-120. MR583416
[2] 2. F. BANCILHON, C. BEERI, P. KANELLAKIS and R. RAMAKRISHNAN, Bounds on the Propagation of Selection into Logic Programs, Proc. A.C.M. Symp. on principles of data base Systems, San Diego, 1987. · Zbl 0796.68054
[3] 3. F. BANCILHON and R. RAMAKRISHNAN, An Amateures Introduction to Recursive Query Processing Strategies, Proc. A.C.M, Sigmod Conf., Washington, 1986.
[4] 4. G. BIRKHOFF, Lattice Theory, A.M.S., 1967. MR227053
[5] 5. A. CHANDRA and D. HAREL, Structure and Complexity of Relational Queries, Jour. Comput. Sys. Sci., Vol. 25, 1982, pp. 99-128. Zbl0511.68073 · Zbl 0511.68073
[6] 6. H. GALLAIRE, J. MINKER and J. M. NICOLAS, Logic and Data Bases: A Deductive Approach, Assoc. Comput. Mach, Comput. Surveys, Vol. 16, 1984, pp. 153-185. Zbl0548.68098 MR792571 · Zbl 0548.68098
[7] 7. G. GARDARIN and C. DE MAINDREVILLE, Evaluation of Data Base Recursive Logic Programs as Recurrent Function Series, Proc. A.C.M. Sigmod Conf., Washington, 1986.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.