Dialectical Proofs for Constrained Argumentation

Authors:
Caroline Devred;Sylvie Doutre;Claire Lefèvre;Pascal Nicolas
Affiliations:
LERIA, University of Angers, France;IRIT, University of Toulouse, France;LERIA, University of Angers, France;LERIA, University of Angers, France
Venue:
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Year:
2010

Citing 18
Cited 4

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

Artificial Intelligence
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Credulous and Sceptical Argument Games for Preferred Semantics

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Dialectic proof procedures for assumption-based, admissible argumentation

Artificial Intelligence
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Audiences in argumentation frameworks

Artificial Intelligence
Elements of Argumentation

Elements of Argumentation
A constrained argumentation system for practical reasoning

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Argue tuProlog: A Lightweight Argumentation Engine for Agent Applications

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Hybrid argumentation and its properties

Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Dungine: a Java Dung Reasoner

Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
From (Quantified) Boolean Formulae to Answer Set Programming

Journal of Logic and Computation
Argumentation in Artificial Intelligence

Argumentation in Artificial Intelligence
The First Version of a New ASP Solver: ASPeRiX

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A labeling approach to the computation of credulous acceptance in argumentation

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A unified framework for representation and development of dialectical proof procedures in argumentation

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Argumentation and answer set programming

Logic programming, knowledge representation, and nonmonotonic reasoning
Argumentation frameworks as constraint satisfaction problems

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Automata for infinite argumentation structures

Artificial Intelligence
Argumentation frameworks as constraint satisfaction problems

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of acceptability of arguments. These constraints are expressed by means of a logical formula which is added to Dung's framework. The resulting system captures several other extensions of Dung's original system. To determine if a set of arguments is credulously inferred from a CAF, the notion of dialectical proof (alternating pros and cons arguments) is extended for Dung's frameworks in order to respect the additional constraint. The new constrained dialectical proofs are computed by using Answer Set Programming.