On the problem of computing ambiguity propagation and well-founded semantics in defeasible logic

Ho Pun Lam*, Guido Governatori

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

3 Citations (Scopus)

Abstract

In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the art, defeasible logic implementation to handle all such variants of defeasible logic.

Original languageEnglish
Title of host publicationSemantic Web Rules - International Symposium, RuleML 2010, Proceedings
PublisherSpringer Verlag
Pages119-127
Number of pages9
ISBN (Print)3642162886, 9783642162886
DOIs
Publication statusPublished - 2010
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6403 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Ambiguity Propagation
  • Consequences finding
  • Defeasible logics
  • Well-Founded Semantics

Fingerprint

Dive into the research topics of 'On the problem of computing ambiguity propagation and well-founded semantics in defeasible logic'. Together they form a unique fingerprint.

Cite this