Fixpoint Semantics for DatalogMTL with Negation
Samuele Pollaci

TL;DR
This paper introduces a formal fixpoint semantics framework for DatalogMTL with negation, leveraging Approximation Fixpoint Theory to unify and extend existing semantics.
Contribution
It defines stable, well-founded, Kripke-Kleene, and supported model semantics for DatalogMTL with negation using AFT, providing a simple and rigorous formal foundation.
Findings
Semantics coincide with previous definitions
Formalization via AFT simplifies understanding
Provides a unified approach to DatalogMTL semantics
Abstract
DatalogMTL with negation is an extension of Datalog with metric temporal operators enriched with unstratifiable negation. In this paper, we define the stable, well-founded, Kripke-Kleene, and supported model semantics for DatalogMTL with negation in a very simple and straightforward way, by using the solid mathematical formalism of Approximation Fixpoint Theory (AFT). Moreover, we prove that the stable model semantics obtained via AFT coincides with the one defined in previous work, through the employment of pairs of interpretations stemming from the logic of here-and-there.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Formal Methods in Verification · Semantic Web and Ontologies
