Practical Reasoning for Expressive Description Logics

Details Practical Reasoning for Expressive Description Logics Practical Reasoning for Expressive Description Logics

2000-05-10

arxiv.org/abs/cs/0005014v1

Computer Science

Logic in Computer Science

This paper appeared in the Proceedings of LPAR'99

Scientific paper

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 present an algorithm that decides satisfiability of the DL ALC extended with transitive and inverse roles, role hierarchies, and qualifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ALC extended with just transitive and inverse roles is still in PSPACE. Finally, we investigate the limits of decidability for this family of DLs.

Affiliated with

Also associated with

No associations

Rating

Practical Reasoning for Expressive Description Logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Practical Reasoning for Expressive Description Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Practical Reasoning for Expressive Description Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636955