scispace - formally typeset
Book ChapterDOI

Relating Defeasible and Default Logic

Reads0
Chats0
TLDR
An ambiguity propagating defeasible logic can be directly embedded into default logic, and Computational complexity results suggest that default logics are more expressive than defeasibles logics.
Abstract
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we will compare an ambiguity propagating defeasible logic with default logic. In fact the two logics take rather contrary approaches: defeasible logic takes a directly deductive approach, whereas default logic is based on alternative possible world views, called extensions. Computational complexity results suggest that default logics are more expressive than defeasible logics. This paper answers the opposite direction: an ambiguity propagating defeasible logic can be directly embedded into default logic.

read more

Citations
More filters
Journal ArticleDOI

A logic programming framework for possibilistic argumentation

TL;DR: A better understanding of possibilistic defeasible logic programming capabilities is provided by defining two non-monotonic operators which model the expansion of a given program by adding new weighed facts associated with argument conclusions and warranted literals, respectively.
Book ChapterDOI

Trust in Secure Communication Systems - The Concept, Representations, and Reasoning Techniques

TL;DR: The concept of trust in general is discussed, and modelling methodologies for describing and reasoning about trust and agent beliefs are investigated.
Journal ArticleDOI

Interdefinability of defeasible logic and logic programming under the well-founded semantics

TL;DR: In this paper, a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction, is presented, where the conclusions of the theories under the ambiguity propagating ADL correspond to those of the well-founded semantics for normal logic programs.
Book ChapterDOI

A fixed-point semantics for plausible logic

TL;DR: This paper gives Plausible Logic a fixed-point semantics, similar to the extensions of Reiter's Default Logic, which is an attempt to define what follows from a plausible theory, rather than merely giving a different characterisation of what is provable.
Book ChapterDOI

Towards Context Sensitive Defeasible Rules

TL;DR: This paper provides a mapping between their argumentation system and Dung's abstract argumentation theory to show its efficacy, and presents an alternative representation of defeasible rules, tailored for argumentation based defeasibles reasoning, that is free of such an assumption.
References
More filters
Journal ArticleDOI

A logic for default reasoning

TL;DR: This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.
Book

Handbook of logic in artificial intelligence and logic programming (vol. 1)

TL;DR: In this paper, the authors refer to break the boredom in reading is choosing handbook of logic in artificial intelligence and logic programming vol 3 nonmonotonic reasoning as the reading material.
Book

Nonmonotonic Reasoning

Book

Defeasible logic

Donald Nute
TL;DR: In this paper, the authors describe one theoretical approach to this problem, discuss implementation of this approach as an extension of Prolog, and describe some application of this work to normative reasoning, learning, planning, and other types of automated reasoning.
Related Papers (5)