scientific article; zbMATH DE number 1953132

zbMATH Open1022.68032MaRDI QIDQ4414535FDOQ4414535

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (5)

• 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
• Operational semantics for fixed-point logics on constraint databases
• Incremental and decremental evaluation of transitive closure by first- order queries
• Title not available (Why is that?)

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)