Generalizing Naive and Stable Semantics in Argumentation Frameworks with Necessities and Preferences

In [4] [5], the classical acceptability semantics are generalized by preferences. The extensions under a given semantics correspond to maximal elements of a relation encoding this semantics and defined on subsets of arguments. Furthermore, a set of postulates is proposed to provide a full characterization of any relation encoding the generalized stable semantics. In this paper, we adapt this approach to preference-based argumentation frameworks with necessities. We propose a full characterization of stable and naive semantics in this new context by new sets of adapted postulates and we present a practical method to compute them by using a classical Dung argumentation framework.

[1]  Farid Nouioua,et al.  A Reconstruction of Abstract Argumentation Admissible Semantics into Defaults and Answer Sets Programming , 2012, ICAART.

[2]  Stefan Woltran,et al.  Abstract Dialectical Frameworks , 2010, KR.

[3]  Trevor J. M. Bench-Capon.  Persuasion in Practical Argument Using Value-based Argumentation Frameworks , 2003, J. Log. Comput..

[4]  C. Cayrol,et al.  On the Acceptability of Arguments in Bipolar Argumentation Frameworks , 2005, ECSQARU.

[5]  Sanjay Modgil,et al.  Reasoning about preferences in argumentation frameworks , 2009, Artif. Intell..

[6]  Srdjan Vesic,et al.  A new approach for preference-based argumentation frameworks , 2011, Annals of Mathematics and Artificial Intelligence.

[7]  Anthony Hunter,et al.  Instantiating abstract argumentation with classical logic arguments: Postulates and properties , 2011, Artif. Intell..

[8]  Witold Łukaszewicz.  Considerations on default logic: an alternative approach 1 , 1988 .

[9]  Philippe Besnard,et al.  Bridging the Gap between Abstract Argumentation Systems and Logic , 2009, SUM.

[10]  Serena Villata,et al.  Support in Abstract Argumentation , 2010, COMMA.

[11]  Claudette Cayrol,et al.  Coalitions of arguments: A tool for handling bipolar argumentation frameworks , 2010 .

[12]  Farid Nouioua,et al.  Argumentation Frameworks with Necessities , 2011, SUM.

[13]  Srdjan Vesic,et al.  Generalizing stable semantics by preferences , 2010, COMMA.

[14]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[15]  Anthony Hunter,et al.  Elements of Argumentation , 2007, ECSQARU.

[16]  Srdjan Vesic,et al.  Repairing Preference-Based Argumentation Frameworks , 2009, IJCAI.

[17]  Robert E. Mercer,et al.  Monotonic Answer Set Programming , 2009, J. Log. Comput..

[18]  Claudette Cayrol,et al.  A Reasoning Model Based on the Production of Acceptable Arguments , 2002, Annals of Mathematics and Artificial Intelligence.

[19]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[20]  Jeff Z. Pan,et al.  An Argument-Based Approach to Using Multiple Ontologies , 2009, SUM.