References of "Kaci, Souhila 30000356"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailDynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
Boella, Guido UL; Kaci, Souhila UL; van der Torre, Leon UL

in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 10th European Conference, ECSQARU 2009, Verona, Italy, July 1-3, 2009. Proceedings (2009)

In this paper we consider the dynamics of abstract argumentation in Baroni and Giacomin’s framework for the evaluation of extension based argumentation semantics. Following Baroni and Giacomin, we do not ... [more ▼]

In this paper we consider the dynamics of abstract argumentation in Baroni and Giacomin’s framework for the evaluation of extension based argumentation semantics. Following Baroni and Giacomin, we do not consider individual approaches, but we define general principles or postulates that individual approaches may satisfy. In particular, we define abstraction principles for the attack relation, and for the arguments in the framework. We illustrate the principles on the grounded extension. In this paper we consider only principles for the single extension case, and leave the multiple extension case to further research. [less ▲]

Detailed reference viewed: 56 (0 UL)
Peer Reviewed
See detailOn the Acceptability of Incompatible Arguments
Kaci, Souhila UL; van der Torre, Leon UL; Weydert, Emil UL

in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 9th European Conference, ECSQARU 2007, Hammamet, Tunisia, October 31 – November 2, 2007, Proceedings (2007)

In this paper we study the acceptability of incompatible arguments within Dung’s abstract argumentation framework. As an example we introduce an instance of Dung’s framework where arguments are ... [more ▼]

In this paper we study the acceptability of incompatible arguments within Dung’s abstract argumentation framework. As an example we introduce an instance of Dung’s framework where arguments are represented by propositional formulas and an argument attacks another one when the conjunction of their representations is inconsistent, which we characterize as a kind of symmetric attack. Since symmetric attack is known to have the drawback to collapse the various argumentation semantics, we consider also two variations. First, we consider propositional arguments distinguishing support and conclusion. Second, we introduce a preference ordering over the arguments and we define the attack relation in terms of a symmetric incompatibility relation and the preference relation. We show how to characterize preference-based argumentation using a kind of acyclic attack relation. [less ▲]

Detailed reference viewed: 65 (2 UL)
Peer Reviewed
See detailPermissions and Uncontrollable Propositions in DSDL3: Non-monotonicity and Algorithms.
Kaci, Souhila UL; van der Torre, Leon UL

in Deontic Logic and Artificial Normative Systems, 8th International Workshop on Deontic Logic in Computer Science, DEON 2006, Utrecht, The Netherlands, July 12-14, 2006, Proceedings (2006)

In this paper we are interested in non-monotonic extensions of Bengt Hansson’s standard dyadic deontic logic 3, known as DSDL3. We study specificity principles for DSDL3 with both controllable and ... [more ▼]

In this paper we are interested in non-monotonic extensions of Bengt Hansson’s standard dyadic deontic logic 3, known as DSDL3. We study specificity principles for DSDL3 with both controllable and uncontrollable propositions. We introduce an algorithm for minimal specificity which not only covers obligations but also permissions, and we discuss the distinction between weak and strong permissions. Moreover, we introduce ways to combine algorithms for minimal and maximal specificity for DSDL3 with controllable and uncontrollable propositions, based on ‘optimistic’ and ‘pessimistic’ reasoning respectively. [less ▲]

Detailed reference viewed: 40 (0 UL)