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)


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
Number of pages7
ISBN (Print)3540383298 , 978-3540383291
Publication statusPublished - 2006
EventFirst Asian Semantic Web Conference - Beijing, China
Duration: 3 Sept 20067 Sept 2006

Publication series

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


ConferenceFirst Asian Semantic Web Conference

Bibliographical note

First Asian Semantic Web Conference, Beijing, China, September 3-7, 2006, Proceedings


Dive into the research topics of 'A reasoning algorithm for pD'. Together they form a unique fingerprint.

Cite this