Sciweavers

70 search results - page 1 / 14
» Inferring acceptable arguments with Answer Set Programming
Sort
View
ENC
2005
IEEE
13 years 11 months ago
Inferring acceptable arguments with Answer Set Programming
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in...
Mauricio Osorio, Claudia Zepeda, Juan Carlos Nieve...
ICLP
2010
Springer
13 years 9 months ago
Towards a General Argumentation System based on Answer-Set Programming
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
Sarah Alice Gaggl
COMMA
2010
13 years 6 days ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
ENC
2008
IEEE
13 years 11 months ago
Possibilistic-Based Argumentation: An Answer Set Programming Approach
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
Juan Carlos Nieves, Ulises Cortés, Mauricio...
RR
2010
Springer
13 years 3 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof