Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11836025_29 | ASWC |
Keywords | Field | DocType |
test result,owl vocabulary,forward-chaining reasoning algorithm,sesame algorithm,low computational complexity,dependent table,redundant inferring step,rdfs entailment,entailment rule,simple entailment rule,computational complexity | Forward chaining,Data mining,Logical consequence,Computer science,Correctness,Description logic,Theoretical computer science,Artificial intelligence,RDF Schema,Vocabulary,Semantics,Computational complexity theory | Conference |
Volume | ISSN | ISBN |
4185 | 0302-9743 | 3-540-38329-8 |
Citations | PageRank | References |
2 | 0.40 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huiying Li | 1 | 30 | 5.32 |
| Yanbing Wang | 2 | 5 | 4.33 |
| Yuzhong Qu | 3 | 927 | 78.03 |
| Jeff Z. Pan | 4 | 2218 | 158.01 |