On the public citation graph

Termination properties of spatial Datalog programs

https://doi.org/10.1007/bfb0031737
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1995.1051openalex-snapshot
Constraint Query Languages
inferredcites →https://doi.org/10.1007/3-540-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/3-540-60299-2openalex-snapshot
Principles and Practice of Constraint Programming — CP '95
inferredcites →https://doi.org/10.1007/3-540-60299-2_10openalex-snapshot
Safe stratified datalog with integer order programs
inferredcites →https://doi.org/10.1007/3-540-60299-2_8openalex-snapshot
First-order definability over constraint databases
inferredcites →https://doi.org/10.1007/978-1-4612-9906-6openalex-snapshot
Geometric Topology in Dimensions 2 and 3
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bfb0062252openalex-snapshot
Ensembles semi-algebriques
inferredcites →https://doi.org/10.1016/0004-3702(88)90049-5openalex-snapshot
Geometric reasoning with logic and algebra
inferredcites →https://doi.org/10.1016/0304-3975(93)90222-fopenalex-snapshot
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1016/s0747-7171(10)80005-7openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
inferredcites →https://doi.org/10.1145/182591.182640openalex-snapshot
Towards a theory of spatial database queries
inferredcites →https://doi.org/10.1145/237661.237667openalex-snapshot
Relational expressive power of constraint query languages
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44503-x_17openalex-snapshot
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
inferred← citeshttps://doi.org/10.1007/3-540-44543-9_14openalex-snapshot
Expressing topological connectivity of spatial databases
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_26openalex-snapshot
Safe Datalog Queries with Linear Constraints
inferred← citeshttps://doi.org/10.1007/3-540-62501-1_29openalex-snapshot
On expressing topological connectivity in spatial Datalog
inferred← citeshttps://doi.org/10.1007/3-540-64823-2_5openalex-snapshot
Degrees of monotonicity of spatial transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_20openalex-snapshot
Region-Based Query Languages for Spatial Databases in the Topological Data Model
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_14openalex-snapshot
Spatial-Yap: A Logic-Based Geographic Information System
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/978-3-662-04031-7_12openalex-snapshot
Genericity in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-662-04031-7_7openalex-snapshot
Datalog and Constraints
inferred← citeshttps://doi.org/10.1007/bfb0031733openalex-snapshot
Logic in Databases
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.034openalex-snapshot
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
inferred← citeshttps://doi.org/10.1145/335168.335214openalex-snapshot
Fixed-point query languages for linear constraint databases
inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot
Logic and Databases Past, Present, and Future
inferred← citeshttps://doi.org/10.18154/rwth-conv-121030openalex-snapshot
Pure and applied fixed point logics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.