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

DOI10.1016/j.tcs.2004.10.034zbMath1080.68026OpenAlexW2153439064MaRDI QIDQ555774

Floris Geerts, Bart Kuijpers

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/945

zbMATH Keywords

Fixed pointsConstraint databasesData base theoryDynamical systems theoryQuery evaluationQuery languages

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Deciding the point-to-fixed-point problem for skew tent maps on an interval

Cites Work

• Computability with low-dimensional dynamical systems
• Reachability and connectivity queries in constraint databases
• Adding a path connectedness operator to \(FO+poly(linear)\)
• Topological elementary equivalence of closed semi-algebraic sets in the real plane
• Operational Semantics for Fixed-Point Logics on Constraint Databases
• Definable Sets in Ordered Structures. III
• Introduction to constraint databases
• Deciding stability and mortality of piecewise affine dynamical systems
• The stability of saturated linear dynamical systems is undecidable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases