Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. This paper describes these scenarios in more detail, and reports on the implementation of a system for defeasible reasoning on the Web. The system (a) is syntactically compatible with RuleML; (b) features strict and
defeasible rules and priorities; (c) is based on a translation to logic programming with declarative semantics; and (d) is flexible and adaptable to different intuitions within defeasible reasoning.
| Original language | English |
|---|
| Title of host publication | Proc. Workshop on Rules and Rule Markup Languages for the Semantic Web (RuleML-2004) |
|---|
| Place of Publication | Berlin |
|---|
| Publisher | Springer |
|---|
| Pages | 23-36 |
|---|
| Publication status | Published - 2004 |
|---|
| Name | Lecture Notes in Computer Science |
|---|
| Volume | 3323 |
|---|
| ISSN (Print) | 0302-9743 |
|---|