Abstract
In this paper we compare the expressive power of various fixed-point logics on linear or dense order constraint databases. This comparison is not done on absolute terms, i.e. by comparing their expressive power for arbitrary queries, rather for definability of partially recursive queries. The motivation for choosing this benchmark comes from fixed-point logics as query languages for constraint databases. Here, non-recursive queries are of no practical interest. It is shown that for linear constraint databases already transitive closure logic is expressive enough to define all partially recursive queries, i.e., transitive-closure logic is expressively complete for this class of databases. It follows that transitive-closure, least, and stratified fixed-point logic are equivalent with respect to this benchmark.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
O. Belegradek, A. Stolboushkin, and M. Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 1998. To appear.
A. Dawar and Y. Gurevich. Fixed-point logics. Bulletin of Symbolic Logic. to appear.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
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.
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.
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.
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.
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).
G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer, 2000.
P. Kolaitis. The expressive power of stratified logic programs. INFORMATION AND COMPUTATION, 90:50–66, 1991.
S. Kreutzer. Descriptive complexity theory for constraint databases, 1999. Diplomarbeit an der RWTH Aachen.
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.
L. Vandeurzen. Logic-Based Query Languages for the Linear Constraint Database Model. PhD thesis, Limburgs Universitair Centrum, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kreutzer, S. (2001). Operational Semantics for Fixed-Point Logics on Constraint Databases. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive