Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Chan Le Duc, Myriam Lamolle
Abstract
Chan Le Duc, Myriam Lamolle
Abstract
Abstract. 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 of models of satisfiable SHIO+-concepts with respect to sets of concept and role inclusion axioms. Additionally, we prove that if we add number restrictions to SHI+ then the satisfiability problem is undecidable.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract. 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 of models of satisfiable SHIO+-concepts with respect to sets of concept and role inclusion axioms. Additionally, we prove that if we add number restrictions to SHI+ then the satisfiability problem is undecidable.
Key concepts: Undecidable problem, Axiom, Decidability, Transitive closure, Transitive relation, Satisfiability, Closure (psychology), Computer science