Abstract

We give the first ExpTime(complexity-optimal) tableau decision procedure for checking satisfiability of a knowledge base in the description logic SHIO , which extends the basic description logic ALC with transitive roles, hierarchies of roles, inverse roles and nominals. Our procedure exploits global state caching and does not use blind (analytic) cuts.

Full Text
Paper version not known

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 call

Disclaimer: 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.