scientific article; zbMATH DE number 1953132

MaRDI QIDQ4414535zbMATH OpenFDO

Authors Floris Geerts, Bart Kuijpers

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2572/25720190.htm

Mathematics Subject Classification ID

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

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
• Publication:4508935
• Relational expressive power of constraint query languages
• scientific article; zbMATH DE number 2080477

Cited in

(5)

• Operational semantics for fixed-point logics on constraint databases
• scientific article; zbMATH DE number 1696858 (Why is no real title available?)
• On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
• Topological formulation of termination properties of iterates of functions
• Incremental and decremental evaluation of transitive closure by first- order queries

This page was built for publication:

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