On the Relationship of Defeasible Argumentation and Answer Set Programming

Authors:
Matthias Thimm;Gabriele Kern-Isberner
Affiliations:
Information Engineering Group, Faculty of Computer Science, Technische Universität Dortmund, Germany;Information Engineering Group, Faculty of Computer Science, Technische Universität Dortmund, Germany
Venue:
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Year:
2008

Citing 6
Cited 5

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Towards a Logic-Based Theory of Argumentation

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
An argumentation based approach for practical reasoning

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An argumentation based approach for practical reasoning

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
On the evaluation of argumentation formalisms

Artificial Intelligence

ANGLE: An autonomous, normative and guidable agent with changing knowledge

Information Sciences: an International Journal
Argumentation and answer set programming

Logic programming, knowledge representation, and nonmonotonic reasoning
On influence and contractions in defeasible logic programming

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Realizing argumentation in multi-agent systems using defeasible logic programming

ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the relationship between defeasible argumentation (DeLP) and answer set programming by transforming a defeasible logic program into an answer set program. We propose two types of conversions that differ with respect to the handling of strict rules. Inference via a dialectical warrant procedure in DeLP turns out to be stronger than credulous answer set inference in both cases, while conversions of the second type bring DeLP inference closer to skeptical answer set inference. Moreover, we investigate some characteristics of the warrant procedure of DeLP which lead to a better understanding of the notion of warrant.