On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
type: Item
instance of: scholarly article
title: On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
zbMATH Open document ID: 1080.68026
author: Floris Geerts
author: Bart Kuijpers
published in: Theoretical Computer Science
publication date: 2005-06-10T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/945
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 2174893
zbMATH Keywords: Data base theory
zbMATH Keywords: Constraint databases
zbMATH Keywords: Query languages
zbMATH Keywords: Query evaluation
zbMATH Keywords: Dynamical systems theory
zbMATH Keywords: Fixed points
MaRDI profile type: Publication
OpenAlex ID: W2153439064
cites work: Q4858735
cites work: Reachability and connectivity queries in constraint databases
cites work: Deciding stability and mortality of piecewise affine dynamical systems
cites work: The stability of saturated linear dynamical systems is undecidable
cites work: Q4210476
cites work: Q4079605
cites work: Q4115143
cites work: Q4850061
cites work: Q5714257
cites work: Adding a path connectedness operator to \(FO+poly(linear)\)
cites work: Computability with low-dimensional dynamical systems
cites work: Operational Semantics for Fixed-Point Logics on Constraint Databases
cites work: Q4473275
cites work: Topological elementary equivalence of closed semi-algebraic sets in the real plane
cites work: Q4935250
cites work: Q3992465
cites work: Definable Sets in Ordered Structures. III
cites work: Q4741395
cites work: Introduction to constraint databases
cites work: Q5807665
cites work: Q4392286
DOI: 10.1016/J.TCS.2004.10.034
description: scientific article; zbMATH DE number 2174893