A reasoning algorithm for pD

Huiying Li, Yanbing Wang, Yuzhong Qu, Jeff Z Pan

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationThe Semantic Web
Subtitle of host publicationASWC 2006
EditorsRiichiro Mizoguchi, Zhongzhi Shi, Fausto Giunchiglia
Place of PublicationBerlin
PublisherSpringer Science+Business Media
Pages293-300
Number of pages7
ISBN (Print)3540383298 , 978-3540383291
DOIs
Publication statusPublished - 2006
EventFirst Asian Semantic Web Conference - Beijing, China
Duration: 3 Sep 20067 Sep 2006

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume4185
ISSN (Print)0302-9743

Conference

ConferenceFirst Asian Semantic Web Conference
CountryChina
CityBeijing
Period3/09/067/09/06

Cite this

Li, H., Wang, Y., Qu, Y., & Pan, J. Z. (2006). A reasoning algorithm for pD. In R. Mizoguchi, Z. Shi, & F. Giunchiglia (Eds.), The Semantic Web : ASWC 2006 (pp. 293-300). (Lecture Notes in Computer Science; Vol. 4185). Springer Science+Business Media. https://doi.org/10.1007/11836025