A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Programming

Authors:
Teresa Alsinet;Carlos Chesòevar;Lluís Godo
Affiliations:
Department of Computer Science. University of Lleida, Spain;Dept. of Computer Science & Eng. Universidad Nacional del Sur, Argentina;Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
Venue:
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Year:
2008

Citing 10
Cited 2

Logical models of argument

ACM Computing Surveys (CSUR)
A logic-based theory of deductive arguments

Artificial Intelligence
Defeasible reasoning with variable degrees of justification

Artificial Intelligence
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
Argument-based critics and recommenders: a qualitative perspective on user support systems

Data & Knowledge Engineering - Special issue: WIDM 2004
On the evaluation of argumentation formalisms

Artificial Intelligence
Knowledge and information distribution leveraged by intelligent agents

Knowledge and Information Systems
A logic programming framework for possibilistic argumentation: Formalization and logical properties

Fuzzy Sets and Systems
An axiomatic account of formal argumentation

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Graduality in argumentation

Journal of Artificial Intelligence Research

A characterization of collective conflict for defeasible argumentation

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
A computational method for defeasible argumentation based on a recursive warrant semantics

IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems. In this paper we present a novel level-based approach to computing warranted arguments in P-DeLP which ensures the above rationality postulate. We also show that our solution presents some advantages in comparison with the use of a transposition operator applied on strict rules.