A Reasoning Algorithm for pD*

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 -- ASWC 2006
Subtitle of host publicationFirst Asian Semantic Web Conference, Beijing, China, September 3-7, 2006, Proceedings
EditorsRiichiro Mizoguchi, Zhongzhi Shi, Fausto Giunchiglia
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages293-299
Number of pages7
ISBN (Electronic)978-3-540-38331-4
ISBN (Print)978-3-540-38329-1
DOIs
Publication statusPublished - 31 Aug 2006
Event1st Asian Semantic Web Conference - Beijing, China
Duration: 3 Sept 20067 Sept 2006
Conference number: 1
https://www.aswc2006.org/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
Volume4185
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st Asian Semantic Web Conference
Abbreviated titleASWC 2006
Country/TerritoryChina
CityBeijing
Period3/09/067/09/06
Internet address

Fingerprint

Dive into the research topics of 'A Reasoning Algorithm for pD*'. Together they form a unique fingerprint.

Cite this