A Description Logic with Transitive and Converse Roles Role Hierarchies and Qualifying Number Restrictions

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We successively present algorithms that decides satisfiability of the DL extended with transitive and inverse roles, role hierarchies, and qualifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation.

[1]  Gert Smolka,et al.  Attributive Concept Descriptions with Unions and Complements , 1989, IWBS Report.

[2]  Bernhard Hollunder,et al.  Subsumption Algorithms for Concept Description Languages , 1990, ECAI.

[3]  Franz Baader.  Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.

[4]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[5]  Franz Baader,et al.  Qualifying Number Restrictions in Concept Languages , 1991, KR.

[6]  Werner Nutt,et al.  On the expressivity of feature logics with negation, functional uncertainty, and sort equations , 1993, J. Log. Lang. Inf..

[7]  Maurizio Lenzerini,et al.  TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.

[8]  Franz Baader,et al.  Cardinality Restrictions on Concepts , 1994, KI.

[9]  Ulrike Sattler,et al.  A Concept Language Extended with Different Kinds of Transitive Roles , 1996, KI.

[10]  Ian Horrocks,et al.  Description Logics with Transitive Roles , 1997, Description Logics.

[11]  Ulrike Sattler,et al.  Terminological knowledge representation systems in a process engineering application , 1998 .

[12]  I. Horrocks,et al.  A PSPACE-algorithm for deciding ALCNIR+-satisfiability , 1998 .

[13]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[14]  Stephan Tobies.  A PSpace Algorithm for Graded Modal Logic , 1999, CADE.

[15]  Giuseppe De Giacomo,et al.  Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL , 2000, Inf. Comput..