Abstract
pD* semantics extends the 'if-semantics' of RDFS to a subset of the OWL vocabulary. It leads to simple entailment rules and relatively low computational complexity for reasoning. In this paper, we propose a forward-chaining reasoning algorithm to support RDFS entailments under the pD* semantics. This algorithm extends the Sesame algorithm to cope with the pD* entailments. In particular, an optimization to the dependent table between entailment rules is presented to eliminate much redundant inferring steps. Finally, some test results are given to illustrate the correctness and performance of this algorithm. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Li, H., Wang, Y., Qu, Y., & Pan, J. Z. (2006). A reasoning algorithm for pD*. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4185 LNCS, pp. 293–299). Springer Verlag. https://doi.org/10.1007/11836025_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
