On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases

Theoretical Computer Science

Volumn 336, Issue 1, 2005, Pages 125-151

  Geerts, Floris ^a   Kuijpers, Bart ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

Constraint databases; Data base theory; Dynamical systems theory; Fixed points; Query evaluation; Query languages

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT THEORY; DATA REDUCTION; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; GRAPH THEORY; POLYNOMIALS; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

CONSTRAINT DATABASES; DATA BASE THEORY; DYNAMICAL SYSTEMS THEORY; FIXED POINTS; QUERY EVALUATION;

COMPUTABILITY AND DECIDABILITY;

EID: 18144415106     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.034     Document Type: Conference Paper

References (28)

1. Ll. Alsedà, J. Llibre, M. Misiurewicz, Combinatorial Dynamics and Entropy in Dimension One, Advances Series in Nonlinear Dynamics, Vol. 5, World Scientific, Singapore, 1993.
2. M. Benedikt, M. Grohe, L. Libkin, L. Segoufin, Reachability and connectivity queries in constraint databases, in: Proc. 19th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (PODS'00), ACM, New York, 2000, pp. 104-115.
3. V.D. Blondel, O. Bournez, P. Koiran, C.H. Papadimitriou, and J.N. Tsitsiklis Deciding stability and mortality of piecewise affine dynamical systems Theoret. Comput. Sci. 255 1-2 2001 687 696
4. V.D. Blondel, O. Bournez, P. Koiran, and J.N. Tsitsiklis The stability of saturated linear dynamical systems is undecidable J. Comput. System Sci. 62 3 2001 442 462
5. J. Bochnak, M. Coste, M.-F. Roy, Real Algebraic Geometry, Ergebenisse der Mathematik und ihrer Grenzgebiete, Vol. 36, Folge 3, Springer, Berlin, 1998.
6. G.E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decomposition, in: Automata Theory and Formal Languages, Lecture Notes in Computer Science, Vol. 33, Springer, Berlin, 1975, pp. 134-183.
7. M. Davis, Y. Matijasevič, J. Robinson, Hilbert's tenth problem, Diophantine equations: positive aspects of a negative solution, in: Mathematical Developments Arising from Hilbert Problems, Vol. 28, American Mathematical Society, Providence, RI, 1976, pp. 323-378.
8. H.-D. Ebbinghaus, and J. Flum Finite Model Theory 1995 Springer Berlin
9. F. Geerts, Linear approximation of semi-algebraic spatial databases using transitive closure logic, in arbitrary dimension, in: G. Ghelli, G. Grahne (Eds.), Proc. 8th Internat. Workshop on Database Programming Languages (DBPL'01), Lecture Notes in Computer Science, Vol. 2397, Springer, Berlin, 2002, pp. 182-197.
10. F. Geerts, B. Kuijpers, Linear approximation of planar spatial databases using transitive-closure logic, in: Proc. 19th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (PODS'00), ACM, New York, 2000, pp. 126-135.
11. Ch. Giannella, and D. Van Gucht Adding a path connectedness operator to FO+poly (linear) Acta Inform. 38 9 2002 621 648
12. S. Grumbach, G. Kuper, Tractable recursion over geometric data, in: G. Smolka (Ed.), Proc. Principles and Practice of Constraint Programming (CP'97), Lecture Notes in Computer Science, Vol. 1330, Springer, Berlin, 1997, pp. 450-462.
13. P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz Constraint query languages J. Comput. System Sci. 51 1 1995 26 52 A preliminary report appeared in the Proc. 9th ACM Symp. on Principles of Database Systems (PODS'90)
14. P. Koiran, M. Cosnard, and M. Garzon Computability with low-dimensional dynamical systems Theoret. Comput. Sci. 132 1994 113 128
15. S. Kreutzer, Fixed-point query languages for linear constraint databases, in: Proc. 19th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (PODS'00), ACM, New York, 2000, pp. 116-125.
16. S. Kreutzer, Operational semantics for fixed-point logics on constraint databases, in: R. Nieuwenhuis, A. Voronkov (Eds.), Proc. 8th Internat. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'01), Lecture Notes in Computer Science, Vol. 2250, Springer, Berlin, 2001, pp. 470-484.
17. S. Kreutzer, Query languages for constraint databases: first-order logic, fixed-points, and convex hulls, in: J. Van den Bussche, V. Vianu (Eds.), Proc. 8th Internat. Conf. on Database Theory (ICDT'01), Lecture Notes in Computer Science, Vol. 1973, Springer, Berlin, 2001, pp. 248-262.
18. B. Kuijpers, J. Paredaens, M. Smits, J. Van den Bussche, Termination properties of spatial Datalog programs, in: D. Pedreschi, C. Zaniolo (Eds.), Internat. Workshop on Logic in Databases (LID'96), Lecture Notes in Computer Science, Vol. 1154, Springer, Berlin, 1996, pp. 101-116.
19. B. Kuijpers, J. Paredaens, and J. Van den Bussche Topological elementary equivalence of closed semi-algebraic sets in the real plane J. Symbolic Logic 65 4 2000 1530 1555
20. B. Kuijpers, M. Smits, On expressing topological connectivity in spatial datalog, in: V. Gaede, A. Brodsky, O. Gunter, D. Srivastava, V. Vianu, M. Wallace (Eds.), Proc. Workshop "Constraint Databases and their Applications" (CDB'97), Lecture Notes in Computer Sciences, Vol. 1191, Springer, Berlin, 1997, pp. 116-133.
21. G.M. Kuper, J. Paredaens, and L. Libkin Constraint Databases 2000 Springer Berlin
22. J. Llibre, C. Preston, Personal Communication. 2002.
23. Y. Matiyasevich Hilbert's Tenth Problem 1993 The MIT Press Cambridge, MA
24. A. Pillay, and C. Steinhorn Definable sets in ordered structures, III Trans. Amer. Math. Soc. 309 1988 469 476
25. C. Preston, Iterates of Maps on an Interval, Lecture Notes in Mathematics, Vol. 999, Springer, Berlin, 1983.
26. P. Revesz Introduction to Constraint Databases 2002 Springer Berlin
27. A. Tarski A Decision Method for Elementary Algebra and Geometry 1951 University of California Press California
28. L. van den Dries Tame Topology and O -minimal Structures 1998 Cambridge University Press Cambridge