| L. Amgoud and C. Cayrol. On the acceptability of arguments in preference-based argumentation framework. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 1--7, 1998. |
....if both arguments relate to the same value, or if no preference between the values has been defined. If V contains a single value, or no preferences are expressed, the AVAF becomes a standard AF. If each argument can map to a different value, we have a Preference Based Argument Framework [1]. In practice we expect the number of values to be small relative to the number of arguments. Many disputes can be naturally modelled using only two values. Note that defeat is only applicable to an AVAF: defeat is always relative to a particular audience. We write defeats a (A,B) to represent ....
Amgoud, L., and Cayrol, C., (1998). On the Acceptability of Arguments in Preference-Based Argumentation, in Cooper, G., and Moral, S., (eds), Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence.
No context found.
L. Amgoud and C. Cayrol, `On the acceptability of arguments in preference-based argumentation framework', in Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 1--7, (1998).
No context found.
L. Amgoud and C. Cayrol. On the acceptability of arguments in preference-based argumentation framework. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 1--7, 1998.
....in natural language dialogues. 2. BACKGROUND In this section we brie y introduce the formal system of argumentation which forms the backbone of our approach. This is inspired by the work of Dung [6] but goes further in dealing with preferences between arguments. Further details are available in [1] We start with a possibly inconsistent knowledge base with no deductive closure. We assume contains formulas of a propositional langage L. stands for classical inference and for logical equivalence. An argument is a proposition and the set of formulae from which it can be inferred: ....
....S defends A i : 8 B undercuts A and A does not defend itself against B then 9 C 2 S such that C undercuts B and B does not defend itself against C . Henceforth, CUndercut;Pref will gather all non undercut arguments and arguments defending themselves against all their undercutting arguments. In [1], it was shown that the set S of acceptable arguments of the argumentation system hA( Undercut ; Pref i is the least xpoint of a function F : S A( F(S) f(H ; h) 2 A( j(H ; h) is defended by Sg Definition 6. The set of acceptable arguments for an argumentation system hA( Undercut ; ....
L. Amgoud and C. Cayrol. On the acceptability of arguments in preference-based argumentation framework. In Proceedings of the 14th Conference on Uncertainty in Arti cial Intelligence, pages 1-7, 1998.
No context found.
L. Amgoud and C. Cayrol. On the acceptability of arguments in preference-based argumentation framework. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 1--7, 1998.
No context found.
L. Amgoud and C. Cayrol. On the acceptability of arguments in preference-based argumentation framework. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 1--7, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC