A note on fixpoint techniques in data base recursive logic programs

Irène Guessarian

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1988)

  • Volume: 22, Issue: 1, page 49-56
  • ISSN: 0988-3754

How to cite

top

Guessarian, Irène. "A note on fixpoint techniques in data base recursive logic programs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 22.1 (1988): 49-56. <http://eudml.org/doc/92300>.

@article{Guessarian1988,
author = {Guessarian, Irène},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {database; logic programs; regular queries; fixed point techniques; nonlinear recursive queries; while loop},
language = {eng},
number = {1},
pages = {49-56},
publisher = {EDP-Sciences},
title = {A note on fixpoint techniques in data base recursive logic programs},
url = {http://eudml.org/doc/92300},
volume = {22},
year = {1988},
}

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
PB - EDP-Sciences
VL - 22
IS - 1
SP - 49
EP - 56
LA - eng
KW - database; logic programs; regular queries; fixed point techniques; nonlinear recursive queries; while loop
UR - http://eudml.org/doc/92300
ER -

References

top
  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. Zbl0796.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
  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.68098MR792571
  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. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.