Deciding termination of query evaluation in transitive-closure logics for constraint databases

DOI10.1007/3-540-36285-1_13MaRDI QIDQ4414535zbMATH OpenFDO

Authors Floris Geerts, Bart Kuijpers

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2572/25720190.htm, http://hdl.handle.net/1942/634

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15)

Recommendations

• On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
• Operational semantics for fixed-point logics on constraint databases
• Constraint databases, queries and query languages
• Relational expressive power of constraint query languages
• scientific article; zbMATH DE number 2080477

Cited in

(5)

• Topological formulation of termination properties of iterates of functions
• Incremental and decremental evaluation of transitive closure by first- order queries
• Constraint-based termination analysis for cyclic active database rules
• Operational semantics for fixed-point logics on constraint databases
• On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases

This page was built for publication: Deciding termination of query evaluation in transitive-closure logics for constraint databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414535)