Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Taking the RDF Model Theory Out for a Spin
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
High performance reasoning with very large knowledge bases: a practical case study
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Combining RDF and part of OWL with rules: semantics, decidability, complexity
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Time – space trade-offs in scaling up RDF schema reasoning
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
Reordering query and rule patterns for query answering in a rete-based inference engine
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
A pragmatic approach for RDFS reasoning over large scale instance data
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
| Hi-index | 0.00 |
A common approach for reasoning is to compute the deductive closure of an ontology using the rules specified and to work on the closure at query time. This approach reduces the run time complexity but increases the space requirements. The main reason of this increase is the type and subclass statements in the ontology. Type statements show a significant percentage in most ontologies. Since subclass is a transitive property, derivation of other statements, in particular type statements relying on it, gives rise to cyclic repetition and an excess of inferred type statements. In brief, a major part of closure computation is deriving the type statements relying on subclass statements. In this paper, we propose a syntactic transformation that is based on novel individual grouping constructs. This transformation reduces the number of inferred type statements relying on subclass relations. Thus, the space requirement of reasoning is reduced without affecting the soundness and the completeness.