Nonmonotonic Nominal Schemas Revisited
نویسنده
چکیده
Recently, a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does not fully cover all formalisms encompassed by the complete language. In this paper, we aim to remedy that by studying an alternative set of restrictions to achieve decidability, and we show that the existing embeddings of the formalisms covered by the full language can be adjusted accordingly.
منابع مشابه
Nominal Schemas for Integrating Rules and Description Logics
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rules in description logic syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal...
متن کاملComplexities of Nominal Schemas
In this extended abstract, we review our recent work “Nominal Schemas in Description Logics: Complexities Clarified” [6], to be presented at KR 2014. The fruitful integration of reasoning on both schema and instance level poses a continued challenge to knowledge representation and reasoning. While description logics (DLs) excel at the former task, rule-based formalisms are often more adequate f...
متن کاملNominal Schemas in Description Logics: Complexities Clarified
Nominal schemas extend description logics (DLs) with a restricted form of variables, thus integrating rule-like expressive power into standard DLs. They are also one of the most recently introduced DL features, and in spite of many works on algorithms and implementations, almost nothing is known about their computational complexity and expressivity. We close this gap by providing a comprehensiv...
متن کاملTowards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas
Extending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms. However, establishing efficient algorithms for reasoning with nominal schemas has so far been a challenge. In this paper, we present an algorithm to reason with the description logic fragment ELROVn, a fragment that extends EL with nominal sc...
متن کاملSROIQ Syntax Approximation by Using Nominal Schemas
Nominal schemas is a recently introduced extension of description logics which makes it possible to express rules which generalize DL-safe ones. A tractable description logic, ELROVn, has been identified. This leads us to the question: can we improve approximate reasoning results by employing nominal schemas? In this paper, we investigate how to approximately cast SROIQ into ELROVn. Using a dat...
متن کامل