Finite Materialisability of Datalog Programs with Metric Temporal Operators

DOI10.1613/JAIR.1.14040MaRDI QIDQ5881808zbMATH OpenOpenAlexFDO

Authors Przemysław Andrzej Wałęga, Michał Zawidzki, Bernardo Cuenca Grau

Publication date 13 March 2023

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.14040

zbMATH Keywords

automated reasoningtemporal reasoning

Mathematics Subject Classification ID

Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Modular materialisation of Datalog programs
• Querying log data with metric temporal logic
• Maintenance of datalog materialisations revisited
• On temporal logic versus Datalog
• Querying datalog programs with temporal logic

Cited in

(3)

• Modular materialisation of Datalog programs
• Querying log data with metric temporal logic
• Reasoning about time in DatalogMTL: course notes (invited paper)

Describes a project that uses

Uses Software

• DatalogMTL

This page was built for publication: Finite Materialisability of Datalog Programs with Metric Temporal Operators

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