Abstract
Nonmonotonic rule systems are expected to play an important role in the layered development of the Semantic Web. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other nonmonotonic rule systems for reasoning with incomplete and inconsistent information. This paper reports on the implementation of a system for defeasible reasoning on the Web. The system 1) is syntactically compatible with RuleML, 2) features strict and defeasible rules, priorities, and two kinds of negation, 3) is based on a translation to logic programming with declarative semantics, 4) is flexible and adaptable to different intuitions within defeasible reasoning, and 5) can reason with rules, RDF, RDF Schema, and (parts of) OWL ontologies.
| Original language | English |
|---|---|
| Pages (from-to) | 233-245 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Knowledge and Data Engineering |
| Volume | 19 |
| Issue number | 2 |
| Early online date | 26 Dec 2006 |
| DOIs | |
| Publication status | Published - 1 Feb 2007 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'DR-prolog: A system for defeasible reasoning with rules and ontologies on the semantic Web'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver