Datalog+/-: A New Family of Languages for Knowledge Representation and Reasoning

In this context, it has been recognized that to handle the complex knowledge-based scenarios encountered today, such as reasoning over large knowledge graphs, Data- log has to

1 In a typical use case, a DDlog program is used in conjunction with a persistent database; database records are fed to DDlog as inputs and the derived facts computed by DDlog

Armas Romero, A., Kaminski, M., Cuenca Grau, B., Horrocks, I.: Module extrac- tion in expressive ontology languages via datalog reasoning.. Cuenca Grau, B., Halaschek-Wiener,

to induce a modular structure and allows users to explore the entire ontology in a sensi- ble manner so that we can find appropriate module.. Atomic decomposition, however,

These languages extend Datalog with features such as existential quantifiers, equalities, and the falsum in rule heads and negation in rule bodies, and, at the same time,

It contains rules, facts, and queries, where the rules consist of: (1) a Datalog + fragment of the rst-order RCC relation denitions; (2) additional rules expressing part of the

We introduced a new type of Relational Transducer [1] and Trans- ducer network [3] tailored for synchronous distributed systems, and sketched the model-theoretic semantics

The central question of this paper is whether the results for guarded positive Datalog ± from [1] can be extended to guarded normal Datalog ± under the WFS and UNA, that is,