Abstract
We define various extensions of first-order logic on linear as well as polynomial constraint databases. First, we extend first-order logic by a convex closure operator and show this logic, FO(conv), to be closed and to have Ptime data-complexity. We also show that a weak form of multiplication is definable in this language and prove the equivalence between this language and the multiplication part of PFOL. We then extend FO(conv) by fixed-point operators to get a query languages expressive enough to capture Ptime. In the last part of the paper we lift the results to polynomial constraint databases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer, 1998.
L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathmatical Society, 21:1–46, 1989.
B.F. Caviness and J.R. Johnson, editors. Quantifier Elimination and Cylindric Algebraic Decomposition. Springer, 1998.
George E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages, number 33 in LNCS, pages 134–183, Berlin, 1975. Springer-Verlag.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science. Springer, 1987.
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 as LNCS, pages 67–82. Springer, 1999.
F. Geerts and B. Kuijpers. Linear approximation of planar spatial databases using transitive-closure logic. In PODS 2000, pages 126–135. ACM Press, 2000.
Jacob E. Goodman and Joseph O’Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
S. Grumbach and J. Su. Finitely representable databases. Journal of Computer and System Sciences, 55:273–298, 1997.
P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. In PODS 1990, pages 299–313, 1990.
G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer, 2000.
B. Kuijpers, J. Paredaens, M. Smits, and J. Van den Bussche. Termination properties of spatial datalog programs. In Logic in Databases, number 1154 in LNCS, pages 101–116, 1996.
S. Kreutzer. Fixed-point query languages for linear constraint databases. In PODS 2000, pages 116–125. ACM press, 2000.
L. Vandeurzen. Logic-Based Query Languages for the Linear Constraint Database Model. PhD thesis, Limburgs Universitair Centrum, 1999.
L. Vandeurzen, M. Gyssens, and D. Van Gucht. An expressive language for linear spatial database queries. In PODS 1998, pages 109–118, 1998.
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). Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. In: Van den Bussche, J., Vianu, V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, vol 1973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44503-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-44503-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41456-8
Online ISBN: 978-3-540-44503-6
eBook Packages: Springer Book Archive