A system for nonmonotonic rules on the web

G. Antoniou, A. Bikakis, G.R. Wagner

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

9 Citations (Scopus)

Abstract

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 languageEnglish
Title of host publicationProc. Workshop on Rules and Rule Markup Languages for the Semantic Web (RuleML-2004)
Place of PublicationBerlin
PublisherSpringer
Pages23-36
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
Volume3323
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'A system for nonmonotonic rules on the web'. Together they form a unique fingerprint.

Cite this