Expressing the Box Cone Radius in the Relational Calculus with Real Polynomial Constraints

Discrete and Computational Geometry

Volumn 30, Issue 4, 2003, Pages 607-622

  Geerts, Floris ^a,b  

^a HASSELT UNIVERSITY   (Belgium)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347383816     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-0770-2     Document Type: Article

References (28)

1. R. Benedetti and J.J. Risler. Real Algebraic and Semi-Algebraic Sets. Hermann, Paris, 1990.
2. M. Benedikt, G. Dong, L. Libkin, and L. Wong, Relational expressive power of constraint query languages. Journal of the ACM, 45(1):1-34, 1998.
3. M. Benedikt, M. Grohe, L. Libkin, and L. Segoufin. Reachability and connectivity queries in constraint databases. In Proceedings of the 19th ACM Symposium on Principles of Database Systems, pages 104-115. ACM Press. New York, 2000.
4. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebenisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, Berlin, 1998.
5. D. Gauld. Differential Topology: An Introduction, volume 72 of A Series of Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York, 1982.
6. F. Geerts. Linear approximation of semi-algebraic spatial databases using transitive closure logic, in arbitrary dimension. In G. Ghelli and G. Grahne, editors, Proceedings of the 8th International Workshop on Databases and Programming Languages, volume 2397 of Lecture Notes in Computer Science, pages 182-197. Springer-Verlag, Berlin, 2002.
7. F. Geerts and B. Kuijpers. Linear approximation of planar spatial databases using transitive-closure logic. In Proceedings of the 19th ACM Symposium on Principles of Database Systems, pages 126-135. ACM Press, New York, 2000.
8. F. Geerts and B. Kuijpers. Expressing topological connectivity of spatial databases. In A. Mendelzon and R. Connor, editors, Research Issues in Structured and Semistructured Database Programming, volume 1949 of Lecture Notes in Computer Science, pages 224-238. Springer-Verlag, Berlin, 2001.
9. F. Geerts, B. Kuijpers, and J. Van den Bussche. Linearization and completeness results for terminating transitive closure queries on spatial databases. Submitted. 2002.
10. C.G. Gibson, K. Wirthmüller, A.A. du Plessis, and E.J.N. Looijenga. Topological Stability of Smooth Mappings, volume 552 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1976.
11. M. Grohe and L. Segoufin. On first-order topological queries. Transaction on Computational Logic, 3(3):336-358, 2002.
12. S. Grumbach and G. Kuper. Tractable recursion over geometric data. In G. Smolka, editor, Proceedings of the 3rd Conference on Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, pages 450-462. Springer-Verlag, Berlin, 1997.
13. P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1):26-52, 1995.
14. S. Kreutzer. Operational semantics for fixed-point logics on constraint databases. In R. Nieuwenhuis and A. Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming and Automated Reasoning, volume 2250 of Lecture Notes in Artificial Intelligence, pages 465-479. Springer-Verlag, Berlin, 2002.
15. B. Kuijpers, J. Paredaens, M. Smits, and J. Van den Bussche. Termination properties of spatial datalog. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID '96), volume 1154 of Lecture Notes in Computer Science, pages 101-116. Springer-Verlag, Berlin, 1996.
16. B. Kuijpers, J. Paredaens, and J. Van den Bussche. Topological elementary equivalence of closed semi-algebraic sets in the real plane. Journal of Symbolic Logic, 65(4): 1530-1555, 2000.
17. B. Kuijpers and M. Smits. On expressing topological connectivity in spatial datalog. In V. Gaede, A. Brodsky, O. Gunter, D. Srivastava, V. Vianu, and M. Wallace, editors, Proceedings of the 2nd Workshop on Constraint Databases and Applications, volume 1191 of Lecture Notes in Computer Science, pages 116-133. Springer-Verlag, Berlin, 1997.
18. G.M. Kuper, J. Paredaens, and L. Libkin, editors. Constraint Databases. Springer-Verlag, Berlin, 2000.
19. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings of the 13th ACM Symposium on Principles of Database Systems, pages 279-288. ACM Press, New York, 1994.
20. E. Rannou. The complexity of stratification compulation. Discrete & Computational Geometry, 19:47-79, 1998.
21. L. Segoufin and V. Vianu. Querying spatial databases via topological invariants. Journal of Computer and System Sciences, 61(2):276-301, 2000.
22. M. Shiota. Geometry of Subanalytic and Semialgebraic Sets. Birkhäuser, Basel, 1997.
23. M. Shiota. Personal communication.
24. L. van den Dries. Alfred Tarski's elimination theory for real closed fields. Journal of Symbolic Logic, 53(1):7-19, 1988.
25. L. van den Dries. Tame Topology and o-minimal Structures. Cambridge University Press, Cambridge, 1998.
26. L. van den Dries and C. Miller. Geometric categories and o-minimal structures. Duke Mathematical Journal, 82(2):497-540, 1996.
27. H. Whitney. Local properties of analytic varieties. Differential and Combinatorial Topology. "A symposium in honor of Marston Morse," pages 205-244. Princeton University Press, Princeton, NJ, 1965.
28. A.J. Wilkie. A theorem of the complement and some new o-minimal structures. Selecta Mathematica, New Series, 5:397-421, 1999.