Decidability of SHI with Transitive Closure of Roles
نویسنده
چکیده
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. We show that SHI+ is decidable by devising a terminating, sound and complete algorithm for deciding satisfiability of concepts in SHI+ with respect to a set of concept and role inclusion axioms.
منابع مشابه
Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First, we propose a decision procedure for the description logic SHIO+, which is obtained from SHIO by adding transitive closure of roles. Next, we show that SHIO+ has the finite model property by providing a upper bound on the size ...
متن کاملA Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms
In this paper, we investigate an extension of the description logic SHIQ––a knowledge representation formalism used for the Semantic Web––with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. It was proved that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. We have identi...
متن کاملThe Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs it is important to have some version of a transitive closure operator so that we can describe such notions as the set of nodes reachable from a program’s variables. On the other hand, with a few notable exceptions, adding transitive closure to even very tame logics makes them undecidable. In this paper we explore the boundary between decidability and undecid...
متن کاملDecidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fragment with transitive guards, and in fact extends its expressive power non-trivially, preserving the complexity: we prove that its satis ability problem is 2Exptime-
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کامل