Author:
Baudinet Marianne,Chomicki Jan,Wolper Pierre
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. M. Baudinet. On the expressiveness of temporal logic programming. To appear in Information and Computation.
2. M. Baudinet. Temporal logic programming is complete and expressive. In Sixteenth ACM Symp. on Principles of Programming Languages, pp. 267–280, Austin, TX, Jan. 1989.
3. M. Baudinet, J. Chomicki, and P. Wolper. Temporal deductive databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, eds., Temporal Databases. Theory, Design, and Implementation, chapter 13, pp. 294–320. Benjamin/Cummings, 1993.
4. M. Baudinet, M. Niézette, and P. Wolper. On the representation of infinite temporal data and queries. In Tenth ACM Symp. on Principles of Database Systems, pp. 280–290, Denver, CO, May 1991.
5. C. Beeri and M. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718–741, Oct. 1984.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Constrained dependencies;Principles and Practice of Constraint Programming — CP '95;1995
2. Temporal query languages: A survey;Lecture Notes in Computer Science