Datalog programs and their persistency numbers

DOI10.1145/1071596.1071597zbMath1367.68026OpenAlexW2069782013MaRDI QIDQ5277729

Eugénie Foustoucos, Foto N. Afrati, Stavros S. Cosmandakis

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1071596.1071597

zbMATH Keywords

boundednessprogram transformationsfinite automataDatalogpersistency numberspersistent variablesbounded-tree width hypergraphs

Mathematics Subject Classification ID

Database theory (68P15) Hypergraphs (05C65) Formal languages and automata (68Q45) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Inherent complexity of recursive queries, 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05