Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in the novel reasoning system Konclude and present further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed nominal schema handling performs well even when compared to (hyper)tableau systems with dedicated rule sup...
When reasoning in description, modal or temporal logics it is often useful to consider axioms repres...
Abstract. Nominal schemas is a recently introduced extension of de-scription logics which makes it p...
Description Logics (DLs) are a family of logic-based knowledge representation formalisms designed to...
Abstract. We present a tableau algorithm for the description logic ALCOV. This description logic is ...
We propose an extension of SROIQ with nominal schemas which can be used like variable nominal conce...
Abstract. Nominal schemas are a new DL constructor which can be used like ”variable nominal classes ...
We propose an extension of SROIQ with nominal schemas which can be used like "variable nominal conce...
Abstract. We propose an extension of SROIQ with nominal schemas which can be used like “variable nom...
Logic-based knowledge representation formalisms, such as Description Logics, constitute the basis of...
When reasoning with description logic (DL) knowledge bases (KBs) which contain a large number of axi...
Nominal schemas extend description logics (DLs) with a re-stricted form of variables, thus integrati...
Nominal schemas is a recently introduced extension of description logics which makes it possible to ...
Abstract. Extending description logics with so-called nominal schemas has been shown to be a major s...
Abstract. Description logics are a family of knowledge representation formalisms that are descended ...
Success in database schema integration depends on the ability to capture real world semantics of the...
When reasoning in description, modal or temporal logics it is often useful to consider axioms repres...
Abstract. Nominal schemas is a recently introduced extension of de-scription logics which makes it p...
Description Logics (DLs) are a family of logic-based knowledge representation formalisms designed to...
Abstract. We present a tableau algorithm for the description logic ALCOV. This description logic is ...
We propose an extension of SROIQ with nominal schemas which can be used like variable nominal conce...
Abstract. Nominal schemas are a new DL constructor which can be used like ”variable nominal classes ...
We propose an extension of SROIQ with nominal schemas which can be used like "variable nominal conce...
Abstract. We propose an extension of SROIQ with nominal schemas which can be used like “variable nom...
Logic-based knowledge representation formalisms, such as Description Logics, constitute the basis of...
When reasoning with description logic (DL) knowledge bases (KBs) which contain a large number of axi...
Nominal schemas extend description logics (DLs) with a re-stricted form of variables, thus integrati...
Nominal schemas is a recently introduced extension of description logics which makes it possible to ...
Abstract. Extending description logics with so-called nominal schemas has been shown to be a major s...
Abstract. Description logics are a family of knowledge representation formalisms that are descended ...
Success in database schema integration depends on the ability to capture real world semantics of the...
When reasoning in description, modal or temporal logics it is often useful to consider axioms repres...
Abstract. Nominal schemas is a recently introduced extension of de-scription logics which makes it p...
Description Logics (DLs) are a family of logic-based knowledge representation formalisms designed to...