Ambiguity propagating defeasible logic and the well-founded semantics

Authors:
Frederick Maier;Donald Nute
Affiliations:
Department of Computer Science and Artificial Intelligence Center, The University of Georgia, Athens, GA;Department of Computer Science and Artificial Intelligence Center, The University of Georgia, Athens, GA
Venue:
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Year:
2006

Citing 8
Cited 3

Negation in logic programming

Journal of Logic Programming
Floating conclusions and zombie paths: two deep difficulties in the “directly skeptical” approach to defeasible inheritance nets

Artificial Intelligence
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Unfounded sets and well-founded semantics for general logic programs

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Embedding Defeasible Logic into Logic Programs

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
On the Relationship between Defeasible Logic and Well-Founded Semantics

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning

Propositional Clausal Defeasible Logic

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Towards a dynamic metalogic implementation of legal argumentation

Proceedings of the 13th International Conference on Artificial Intelligence and Law
A dynamic metalogic argumentation framework implementation

RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The most recent version of defeasible logic (Nute, 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs using a simple scheme proposed in (Brewka, 2001). It is found that by introducing ambiguity propagation into this logic, the assertions of defeasible theories coincide with the well-founded models of their logic program translations. Without this addition, the two formalisms are found to disagree in important cases. A translation in the other direction is also provided. By treating default negated atoms as presumptions in defeasible logic, normal logic programs can be converted into equivalent defeasible theories.