Finite Open-World Query Answering with Number Restrictions

03/05/2020
by   Antoine Amarilli, et al.
0

Open-world query answering is the problem of deciding, given a set of facts, conjunction of constraints, and query, whether the facts and constraints imply the query. This amounts to reasoning over all instances that include the facts and satisfy the constraints. We study finite open-world query answering (FQA), which assumes that the underlying world is finite and thus only considers the finite completions of the instance. The major known decidable cases of FQA derive from the following: the guarded fragment of first-order logic, which can express referential constraints (data in one place points to data in another) but cannot express number restrictions such as functional dependencies; and the guarded fragment with number restrictions but on a signature of arity only two. In this paper, we give the first decidability results for FQA that combine both referential constraints and number restrictions for arbitrary signatures: we show that, for unary inclusion dependencies and functional dependencies, the finiteness assumption of FQA can be lifted up to taking the finite implication closure of the dependencies. Our result relies on new techniques to construct finite universal models of such constraints, for any bound on the maximal query size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2022

Tighter bounds for query answering with Guarded TGDs

We consider the complexity of the open-world query answering problem, wh...
research
09/19/2013

A finite axiomatization of conditional independence and inclusion dependencies

We present a complete finite axiomatization of the unrestricted implicat...
research
12/16/2022

Rewriting the Infinite Chase

Guarded tuple-generating dependencies (GTGDs) are a natural extension of...
research
09/10/2018

Finite Satisfiability of Unary Negation Fragment with Transitivity

We show that the finite satisfiability problem for the unary negation fr...
research
05/24/2021

Harmless but Useful: Beyond Separable Equality Constraints in Datalog+/-

Ontological query answering is the problem of answering queries in the p...
research
08/05/2021

Handling Inconsistencies in Tables with Nulls and Functional Dependencies

In this paper we address the problem of handling inconsistencies in tabl...
research
07/02/2018

Probabilistic Databases with an Infinite Open-World Assumption

Probabilistic databases (PDBs) introduce uncertainty into relational dat...

Please sign up or login with your details

Forgot password? Click here to reset