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 language | English |
---|---|
Title of host publication | The Semantic Web -- ASWC 2006 |
Subtitle of host publication | First Asian Semantic Web Conference, Beijing, China, September 3-7, 2006, Proceedings |
Editors | Riichiro Mizoguchi, Zhongzhi Shi, Fausto Giunchiglia |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 293-299 |
Number of pages | 7 |
ISBN (Electronic) | 978-3-540-38331-4 |
ISBN (Print) | 978-3-540-38329-1 |
DOIs | |
Publication status | Published - 31 Aug 2006 |
Event | 1st Asian Semantic Web Conference - Beijing, China Duration: 3 Sept 2006 → 7 Sept 2006 Conference number: 1 https://www.aswc2006.org/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Berlin, Heidelberg |
Volume | 4185 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 1st Asian Semantic Web Conference |
---|---|
Abbreviated title | ASWC 2006 |
Country/Territory | China |
City | Beijing |
Period | 3/09/06 → 7/09/06 |
Internet address |