Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying

09/06/2022
by   Thomas Feller, et al.
0

In our pursuit of generic criteria for decidable ontology-based querying, we introduce 'finite-cliquewidth sets' (FCS) of existential rules, a model-theoretically defined class of rule sets, inspired by the cliquewidth measure from graph theory. By a generic argument, we show that FCS ensures decidability of entailment for a sizable class of queries (dubbed 'DaMSOQs') subsuming conjunctive queries (CQs). The FCS class properly generalizes the class of finite-expansion sets (FES), and for signatures of arity at most 2, the class of bounded-treewidth sets (BTS). For higher arities, BTS is only indirectly subsumed by FCS by means of reification. Despite the generality of FCS, we provide a rule set with decidable CQ entailment (by virtue of first-order-rewritability) that falls outside FCS, thus demonstrating the incomparability of FCS and the class of finite-unification sets (FUS). In spite of this, we show that if we restrict ourselves to single-headed rule sets over signatures of arity at most 2, then FCS subsumes FUS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2021

Parallelisable Existential Rules: a Story of Pieces

In this paper, we consider existential rules, an expressive formalism we...
research
07/17/2023

Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets

This paper establishes alternative characterizations of very expressive ...
research
04/13/2023

Decidability of Querying First-Order Theories via Countermodels of Finite Width

We propose a generic framework for establishing the decidability of a wi...
research
04/28/2015

Combining Existential Rules and Transitivity: Next Steps

We consider existential rules (aka Datalog+) as a formalism for specifyi...
research
07/16/2021

Capturing Homomorphism-Closed Decidable Queries with Existential Rules

Existential rules are a very popular ontology-mediated query language fo...
research
04/18/2023

Embedded Finite Models beyond Restricted Quantifier Collapse

We revisit evaluation of logical formulas that allow both uninterpreted ...
research
02/11/2019

On the Convergence of Network Systems

The apparent disconnection between the microscopic and the macroscopic i...

Please sign up or login with your details

Forgot password? Click here to reset