Title
Efficient Reasoning with Range and Domain Constraints
Abstract
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedure for the satisfiability and subsumption of SHIQ concepts w.r.t. such a role box, and show how support for range and domian axioms can be exploited in order to add a new form of absorption opti- misation called role absorption. We illustrate the effectiveness of the optimised algorithm by analysing the perfomance of our FaCT++ implementation when classifying terminologies derived from realistic ontologies.
Year
Venue
Keywords
2004
Description Logics
satisfiability
Field
DocType
Citations 
Mathematical optimization,Computer science,Algorithm
Conference
36
PageRank 
References 
Authors
4.95
16
2
Name
Order
Citations
PageRank
Dmitry Tsarkov179449.29
Ian Horrocks2117311086.65