Operational semantics for fixed-point logics on constraint databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2250, Issue , 2001, Pages 470-484

  Kreutzer, Stephan ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; SEMANTICS;

CONSTRAINT DATABASES; DEFINABILITY; EXPRESSIVE POWER; FIXED-POINT LOGIC; LINEAR CONSTRAINTS; OPERATIONAL SEMANTICS; ORDERING CONSTRAINTS; TRANSITIVE CLOSURE;

ARTIFICIAL INTELLIGENCE;

EID: 23044530688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_32     Document Type: Conference Paper

References (13)

1. O. Belegradek, A. Stolboushkin, and M. Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 1998. To appear.
2. A. Dawar and Y. Gurevich. Fixed-point logics. Bulletin of Symbolic Logic. to appear.
3. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
4. S. Grumbach and G. M. Kuper. Tractable recursion over geometric data. In Principles and Practice of Constraint Programming, number 1330 in LNCS, pages 450-462. Springer, 1997.
5. E. Grädel and S. Kreutzer. Descriptive complexity theory for constraint databases. In Computer Science Logic, number 1683 in LNCS, pages 67-82. Springer, 1999.
6. F. Geerts and B. Kuijpers. Linear approximation of planar spatial databases using transitive-closure logic. In Proceedings of the 19th ACM Symp. on Principles of Database Systems (PODS), 2000, pages 126-135. ACM Press, 2000.
7. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 299-313, 1990.
8. P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. Journal of Computer and Systems Sciences, 51:26-52, 1995. (An extended abstract appeared in the Proceedings of PODS'90).
9. G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer, 2000.
10. P. Kolaitis. The expressive power of stratified logic programs. INFORMATION AND COMPUTATION, 90:50-66, 1991.
11. S. Kreutzer. Descriptive complexity theory for constraint databases, 1999. Diplomarbeit an der RWTH Aachen.
12. S. Kreutzer. Query languages for constraint databases: First-order logic, fixed-points, and convex hulls. In Proceedings of the 8th International Conference on Database Theory (ICDT), number 1973 in Lecture Notes in Computer Science, pages 248-262. Springer, 2001.
13. L. Vandeurzen. Logic-Based Query Languages for the Linear Constraint Database Model. PhD thesis, Limburgs Universitair Centrum, 1999.