Search Results for author:
Found 5 papers, 0 papers with code
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushdown languages.
Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics
We present a unified approach to (both finite and unrestricted) worst-case optimal entailment of (unions of) conjunctive queries (U)CQs in the wide class of "locally-forward" description logics.
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard
In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the inferencing problem of primary interest.
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
On the other hand, the satisfiability problem becomes undecidable if inverse roles are added to the languages.
Statistical EL is ExpTime-complete
We show that the consistency problem for Statistical EL ontologies, defined by Pe{\~{n}}aloza and Potyka, is ExpTime-hard.
