The Complexity and Expressive Power of Limit Datalog

DOI10.1145/3495009MaRDI QIDQ5066944zbMATH OpenOpenAlexWikidataFDO

Authors Mark Kaminski, Egor V. Kostylev, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks

Publication date 31 March 2022

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:d07e93d8-c502-4501-80eb-befd6e6d8f61

zbMATH Keywords

Datalogdeclarative data analytics

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Declarative Data Analysis Using Limit Datalog Programs
• Circumscribing DATALOG: expressive power and complexity
• The Complexity of Datalog on Linear Orders
• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues

Cited in

(2)

• The expressive powers of stable models for bound and unbound DATALOG queries
• Declarative Data Analysis Using Limit Datalog Programs

This page was built for publication: The Complexity and Expressive Power of Limit Datalog

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