Author:
Guessarian Irène,Veloso-Peixoto Marcos
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. K. Apt, H. Blair, A. Walker, Towards a theory of declarative knowledge, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1988), 89–148.
2. S. Abiteboul, Boundedness is undecidable for Datalog programs with a single recursive rule, IPL 32 (1989), 281–287.
3. S. Abiteboul, V. Vianu, DATALOG extensions for database queries and updates, INRIA report 900 (1988).
4. M. Ajtai, Y. Gurevich, Datalog versus first order logic, Proc. 30th IEEE FOCS, (1989), 142–148.
5. C. Beeri, P. Kanellakis, F. Bancilhon, R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proc. 6th. ACM-PODS, San Diego (1987), 214–226.