On expressing topological connectivity in spatial datalog

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

Volumn 1191, Issue , 1996, Pages 116-133

  Kuijpers, Bart ^a   Smits, Marc ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT DATABASES; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS; QUERY PROCESSING; SOFTWARE TESTING; TOPOLOGY;

DATALOG; DATALOG PROGRAMS; EXPRESSIBILITY; PIECEWISE LINEAR; POLYNOMIAL INEQUALITIES; QUADRATIC POLYNOMIAL; SPATIAL DATABASE; TOPOLOGICAL CONNECTIVITY;

DATABASE SYSTEMS;

EID: 84959020078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62501-1_29     Document Type: Conference Paper

References (16)

1. D.S. Arnon. Geometric reasoning with logic and algebra. Artificial Intelligence, 37:37-60, 1988.
2. M. Benedikt, G. Dong, L. Libkm, and L. Wong. Relational expressive power of constraint query languages. In Proceedings 15th ACM Symposium on Principles of Database Systems. ACM Press, 1996.
3. J. Bochnak, M. Coste, and M.-F. Roy. Geometric algebnque reelle. Springer-Verlag, 1987.
4. G.E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Lecture Notes in Computer Science, 33:134-183, 1975.
5. M. Coste. Ensembles semi-algebriques. In Geometric algebrique reelle et formes quadratiques, volume 959 of Lecture Notes in Mathematics, pages 109-138. Springer, 1982.
6. W. Fulton Algebraic curves: an introduction to algebraic geometry New York, 1969
7. S. Grumbach and J. Su. First-order definability over constraint databases. In Montanari and Rossi [12], pages 121-136.
8. M. Gyssens, J. Van den Bussche, and D. Van Gucht. Complete geometrical query languages. Manuscript, 1996.
9. P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51(1):26-52, August 1995.
10. B. Kuijpers, J. Paredaens, M. Smits, and J. Van den Bussche Termination properties of spatial datalog programs. Proceedings of the International Workshop Logic in Databases (LID '96), (Eds. D. Pedreschi, C. Zaniolo) Lecture Notes in Computer Science, 1154, October 1996.
11. E.E. Moise. Geometric topology in dimensions 2 and 3, volume 47 of Graduate Texts in Mathematics. Springer, 1977.
12. U. Montanari and F. Rossi, editors. Principles and practice of constraint programming, volume 976 of Lecture Notes in Computer Science. Springer, 1995.
13. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings 13th ACM Symposium on Principles of Database Systems, pages 279-288. ACM Press, 1994.
14. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13, 1992.
15. J.T. Schwartz and M. Sharir. On the piano movers' problem II. In J.T. Schwartz, M. Sharir, and J. Hopcroft, editors, Planning, Geometry, and Complexity of Robot Motion, pages 51-96. Ablex Publishing Corporation, Norwood, New Jersey, 1987.
16. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.