In order to automate verification process, regulatory rules written in natural language need to
be translated into a format that machines can understand. However, none of the existing …

To address the needs of the EU NoAW project, in this paper we solve the problem of
efficiently generating the argumentation graphs from knowledge bases expressed using …

This paper proposes a practically-oriented benchmark suite for computational
argumentation. We instantiate abstract argumentation frameworks with existential rules, a …

Data trees, typically encoded in JSON, are ubiquitous in data-driven applications. This
ubiquity makes urgent the development of novel techniques for querying heterogeneous …

The chase procedure for existential rules is an indispensable tool for several database
applications, where its termination guarantees the decidability of these tasks. Most previous …

Conducting experimental analysis on rule reasoners is a mainstream task for validating
novel algorithms and systems. Nevertheless, providing robust, verifiable, and reproducible …

This article first distinguishes constraints from rules, and descriptive constraints from
prescriptive ones. Both kinds can be used to calculate a constraint-based completeness (as …

Most query rewriting systems focus on answering Conjunctive Queries that have only
positive atoms because the use of negation can easily make the entailment problem …

In this paper, we explore conjunctive query rewriting, focusing on queries containing
universally quantified negation within the framework of disjunctive existential rules. We …

Conducting experimental analysis on rule reasoners is a mainstream task for validating
novel algorithms and systems. Nevertheless, providing robust, verifiable, and reproducible …