A note on fixpoint techniques in data base recursive logic programs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 22 (1988) no. 1, pp. 49-56.
@article{ITA_1988__22_1_49_0,
     author = {Guessarian, Ir\`ene},
     title = {A note on fixpoint techniques in data base recursive logic programs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {49--56},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {1},
     year = {1988},
     zbl = {0647.68110},
     mrnumber = {945924},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1988__22_1_49_0/}
}
TY  - JOUR
AU  - Guessarian, Irène
TI  - A note on fixpoint techniques in data base recursive logic programs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1988
DA  - 1988///
SP  - 49
EP  - 56
VL  - 22
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1988__22_1_49_0/
UR  - https://zbmath.org/?q=an%3A0647.68110
UR  - https://www.ams.org/mathscinet-getitem?mr=945924
LA  - en
ID  - ITA_1988__22_1_49_0
ER  - 
%0 Journal Article
%A Guessarian, Irène
%T A note on fixpoint techniques in data base recursive logic programs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 49-56
%V 22
%N 1
%I EDP-Sciences
%G en
%F ITA_1988__22_1_49_0
Guessarian, Irène. A note on fixpoint techniques in data base recursive logic programs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 22 (1988) no. 1, pp. 49-56. http://www.numdam.org/item/ITA_1988__22_1_49_0/

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. | MR

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.

3. F. Bancilhon and R. Ramakrishnan, An Amateures Introduction to Recursive Query Processing Strategies, Proc. A.C.M, Sigmod Conf., Washington, 1986.

4. G. Birkhoff, Lattice Theory, A.M.S., 1967. | MR

5. A. Chandra and D. Harel, Structure and Complexity of Relational Queries, Jour. Comput. Sys. Sci., Vol. 25, 1982, pp. 99-128. | Zbl

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. | MR | Zbl

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.