Finite Satisfiability of Unary Negation Fragment with Transitivity

09/10/2018
by   Daniel Danielski, et al.
0

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require that some binary symbols are interpreted as arbitrary transitive relations, some are interpreted as partial orders and some as equivalences. As the unary negation fragment can express (negations of) unions of conjunctive queries this gives in particular the decidability of the classical problem from database theory, finite open-world query answering, for some interesting scenarios involving the above mentioned semantic constraints. We also consider finite satisfiability of some extensions of our primary logic, in particular capturing the concept of role hierarchies known from description logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2018

Unary negation fragment with equivalence relations has the finite model property

We consider an extension of the unary negation fragment of first-order l...
research
06/21/2019

The Fluted Fragment with Transitivity

We study the satisfiability problem for the fluted fragment extended wit...
research
06/19/2020

The Fluted Fragment with Transitive Relations

We study the satisfiability problem for the fluted fragment extended wit...
research
07/19/2023

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features

We investigate the impact of non-regular path expressions on the decidab...
research
06/29/2021

The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard

In logic-based knowledge representation, query answering has essentially...
research
03/05/2020

Finite Open-World Query Answering with Number Restrictions

Open-world query answering is the problem of deciding, given a set of fa...
research
06/05/2014

On the satisfiability problem for SPARQL patterns

The satisfiability problem for SPARQL patterns is undecidable in general...

Please sign up or login with your details

Forgot password? Click here to reset