Abstract
The description logic ALCQI extends the 'standard' description logic ALC by qualifying number restrictions and converse roles. We show that conept satisfiability for this DL is still decidable in polynomial space. The presented algorithm combines techniques from [Tob99a] to deal with qualifying number restrictions and from [HST99] to deal with converse roles. Additionally, we extend the result to ALCQIR, which extends ALCQI by role intersections. This solves an open problem from [DLNN97]. The result for ALCQI has already been presented in the seperate technical report [Tob99b]. In this report we use the same techniques to obtain the stronger result for ALCQIR.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
