Operational semantics for fixed-point logics on constraint databases

DOI10.1007/3-540-45653-8_32MaRDI QIDQ2996184zbMATH OpenOpenAlexFDO

Authors Stephan Kreutzer

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45653-8_32

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Database theory (68P15) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 2080477
• scientific article; zbMATH DE number 1424028
• On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
• scientific article; zbMATH DE number 1953132
• scientific article; zbMATH DE number 1515857

Cited in

(4)

• scientific article; zbMATH DE number 1953132 (Why is no real title available?)
• scientific article; zbMATH DE number 2080477 (Why is no real title available?)
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases

This page was built for publication: Operational semantics for fixed-point logics on constraint databases

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