Stratified negation in datalog with metric temporal operators

Stratified negation in datalog with metric temporal operators

We extend DatalogMTL—Datalog with operators from metric temporal logic—by adding stratified negation as failure. The new language provides additional expressive power for representing and reasoning about temporal data and knowledge in a wide range of applications. We consider models over the rationa...

Descripció completa

Dades bibliogràfiques
Autors principals:	Tena Cucala, D, Walega, P, Cuenca Grau, B, Kostylev, E
Format:	Conference item
Idioma:	English
Publicat:	AAAI Press 2021

Ítems similars

The stable model semantics of datalog with metric temporal operators
per: Walega, P, et al.
Publicat: (2023)

Tractable fragments of datalog with metric temporal operators
per: Wałęga, PA, et al.
Publicat: (2020)

DatalogMTL with negation under stable models semantics
per: Wałęga, PA, et al.
Publicat: (2021)

Finitely materialisable Datalog programs with metric temporal operators
per: Wałęga, PA, et al.
Publicat: (2021)

Finite materialisability of Datalog programs with metric temporal operators
per: Wałęga, PA, et al.
Publicat: (2023)

Stratified negation in limit datalog programs
per: Kaminski, M, et al.
Publicat: (2018)

MeTeoR: practical reasoning in datalog with metric temporal operators
per: Wang, D, et al.
Publicat: (2022)

Bridging max graph neural networks and datalog with negation
per: Tena Cucala, D, et al.
Publicat: (2024)

Reasoning over streaming data in metric temporal datalog
per: Walega, P, et al.
Publicat: (2019)

On the correspondence between monotonic max-sum GNNs and datalog
per: Tena Cucala, D, et al.
Publicat: (2023)

On the correspondence between monotonic max-sum GNNs and Datalog
per: Tena Cucala, D, et al.
Publicat: (2023)

DatalogMTL: computational complexity and expressive power
per: Walega, P, et al.
Publicat: (2019)

DatalogMTL over integer timeline
per: Walega, PA, et al.
Publicat: (2020)

Complexity and expressive power of disjunction and negation in limit datalog
per: Kaminski, M, et al.
Publicat: (2020)

Reasoning techniques in DatalogMTL
per: Wałega, PA, et al.
Publicat: (2022)

Stream reasoning with DatalogMTL
per: Walega, P, et al.
Publicat: (2023)

Stream reasoning in temporal datalog
per: Ronca, A, et al.
Publicat: (2018)

Materialisation-based reasoning in DatalogMTL with bounded intervals
per: Wałęga, PA, et al.
Publicat: (2023)

Temporal datalog with existential quantification
per: Lanzinger, M, et al.
Publicat: (2023)

The complexity and expressive power of limit Datalog
per: Kaminski, M, et al.
Publicat: (2021)

Controlled query evaluation for datalog and OWL 2 profile ontologies
per: Kostylev, E, et al.
Publicat: (2015)

Foundations of Declarative Data Analysis Using Limit Datalog Programs
per: Kaminski, M, et al.
Publicat: (2017)

Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
per: Cuenca Grau, B, et al.
Publicat: (2016)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Controlled query evaluation for datalog and OWL 2 profile ontologies
per: Grau, B, et al.
Publicat: (2015)

Explainable GNN-based models over knowledge graphs
per: Tena Cucala, DJ, et al.
Publicat: (2022)

Limit Datalog: A declarative query language for data analysis
per: Grau, BC, et al.
Publicat: (2020)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Generative Datalog with stable negation
per: Alviano, M, et al.
Publicat: (2023)

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
per: Kaminski, M, et al.
Publicat: (2014)

Pay-as-you-go consequence-based reasoning for the description logic SROIQ
per: Tena Cucala, D, et al.
Publicat: (2021)

Faithful approaches to rule learning
per: Tena Cucala, DJ, et al.
Publicat: (2022)

Computing Datalog Rewritings Beyond Horn Ontologies
per: Grau, B, et al.
Publicat: (2013)

Sufficient Conditions for First−Order and Datalog Rewritability in ELU
per: Kaminski, M, et al.
Publicat: (2013)

Integrating Datalog with OWL: Exploring the AL−log Approach.
per: Ruckhaus, E, et al.
Publicat: (2006)

PAGOdA: Pay-As-You-Go query answering using a datalog reasoner
per: Zhou, Y, et al.
Publicat: (2015)

Datalog rewriting techniques for non-Horn ontologies
per: Kaminski, M, et al.
Publicat: (2014)

$n$-permutability and linear Datalog implies symmetric Datalog
per: Alexandr Kazda
Publicat: (2018-04-01)