A reasoning algorithm for pd*

Authors:
Huiying Li;Yanbing Wang;Yuzhong Qu;Jeff Z. Pan
Affiliations:
Department of Computer Science and Engineering, Southeast University, Nanjing, P.R China;Department of Computer Science and Engineering, Southeast University, Nanjing, P.R China;Department of Computer Science and Engineering, Southeast University, Nanjing, P.R China;Department of Computing Science, The University of Aberdeen, UK
Venue:
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Year:
2006

Citing 5
Cited 1

Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Pellet: A practical OWL-DL reasoner

Web Semantics: Science, Services and Agents on the World Wide Web
Building the semantic web tower from RDF straw

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary

Web Semantics: Science, Services and Agents on the World Wide Web

Combining a DL Reasoner and a Rule Engine for Improving Entailment-Based OWL Reasoning

ISWC '08 Proceedings of the 7th International Conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

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.