Termination properties of spatial datalog programs

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

Volumn 1154, Issue , 1996, Pages 101-116

  Kuijpers, Bart ^a   Paredaens, Jan ^a   Smits, Marc ^a   Van Den Bussche, Jan ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; QUERY LANGUAGES; RECONFIGURABLE HARDWARE;

DATALOG; DATALOG PROGRAMS; POLYNOMIAL INEQUALITIES; RECURSIVE PROGRAMS; SPATIAL DATABASE; SPATIAL QUERIES; TERMINATION PROPERTY; TOPOLOGICAL CONNECTIVITY;

INTELLIGENT DATABASES;

EID: 84949457659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0031737     Document Type: Conference Paper

References (17)

1. D.S. Arnon. Geometric reasoning with logic and algebra. Artificial Intelligence, 37:37-60, 1988.
2. M. Benedikt, G. Dong, L. Libkin, 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. Géométrie algébrique réelle. 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-algébriques. In Géometrie algébrique réelle et formes quadratiques, volume 959 of Lecture Notes in Mathematics, pages 109-138. Springer, 1982.
6. S. Grumbach and J. Su. First-order definability over constraint databases. In Montanari and Rossi [10], pages 121-136.
7. M. Gyssens, J. Paredaens, J. Van den Bussche, and D. Van Gucht. Computable queries for spatial database systems. In preparation.
8. 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.
9. E.E. Moise. Geometric topology in dimensions 2 and 3, volume 47 of Graduate Texts in Mathematics. Springer, 1977.
10. U. Montanari and F. Rossi, editors. Principles and practice of constraint programming, volume 976 of Lecture Notes in Computer Science. Springer, 1995.
11. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings 13th A CM Symposium on Principles of Database Systems, pages 279-288. ACM Press, 1994.
12. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13, 1992.
13. P.Z. Revesz. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 116:117-149, 1993.
14. P.Z. Revesz. Safe stratified Datalog with integer order programs. In Montanari and Rossi [10], pages 154-169.
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.
17. J. UUman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.