12 research outputs found
Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
We present a terminating tableau calculus for graded hybrid logic with global
modalities, reflexivity, transitivity and role hierarchies. Termination of the
system is achieved through pattern-based blocking. Previous approaches to
related logics all rely on chain-based blocking. Besides being conceptually
simple and suitable for efficient implementation, the pattern-based approach
gives us a NExpTime complexity bound for the decision procedure
On query answering in description logics with number restrictions on transitive roles
We study query answering in the description logic SQ supporting
number restrictions on both transitive and non-transitive roles.
Our main contributions are (i) a tree-like model property for SQ knowledge
bases and, building upon this, (ii) an automata based decision
procedure for answering two-way regular path queries, which gives a
3ExpTime upper bound
Adding Transitivity and Counting to the Fluted Fragment
We study the impact of adding both counting quantifiers and a single transitive relation to the fluted fragment - a fragment of first-order logic originating in the work of W.V.O. Quine. The resulting formalism can be viewed as a multi-variable, non-guarded extension of certain systems of description logic featuring number restrictions and transitive roles, but lacking role-inverses. We establish the finite model property for our logic, and show that the satisfiability problem for its k-variable sub-fragment is in (k+1)-NExpTime. We also derive ExpSpace-hardness of the satisfiability problem for the two-variable, fluted fragment with one transitive relation (but without counting quantifiers), and prove that, when a second transitive relation is allowed, both the satisfiability and the finite satisfiability problems for the two-variable fluted fragment with counting quantifiers become undecidable
Answering regular path queries over SQ ontologies
We study query answering in the description logic SQ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for SQ-knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2EXPTIME
Answering regular path queries mediated by unrestricted SQ ontologies
A prime application of description logics is ontology-mediated query answering, with the query language often reaching far beyond instance queries. Here, we investigate this task for positive existential two-way regular path queries and ontologies formulated in the expressive description logic , where denotes the extension of the basic description logic with transitive roles () and qualified number restrictions () which can be unrestrictedly applied to both non-transitive and transitive roles (). Notably, the latter is usually forbidden in expressive description logics. As the main contribution, we show decidability of ontology-mediated query answering in that setting and establish tight complexity bounds, namely 2ExpTime-completeness in combined complexity and coNP-completeness in data complexity. Since the lower bounds are inherited from the fragment , we concentrate on providing upper bounds. As main technical tools we establish a tree-like countermodel property and a characterization of when a query is not satisfied in a tree-like interpretation. Together, these results allow us to use an automata-based approach to query answering