Parametric Properties of Ideal Semantics

The concept of "ideal semantics" has been promoted as an alternative basis for skeptical reasoning within abstract argumentation settings. Informally, ideal acceptance not only requires an argument to be skeptically accepted in the traditional sense but further insists that the argument is in an admissible set all of whose arguments are also skeptically accepted. The original proposal was couched in terms of the so-called preferred semantics for abstract argumentation. We argue, in this paper, that the notion of "ideal acceptability" is applicable to arbitrary semantics and justify this claim by showing that standard properties of classical ideal semantics, e.g. unique status, continue to hold in any "reasonable" extension-based semantics. We categorise the relationship between the divers concepts of "ideal extension wrt semantics σ" that arise and we present a comprehensive analysis of algorithmic and complexity-theoretic issues.

[1]  Paul E. Dunne,et al.  The computational complexity of ideal semantics , 2009, Artif. Intell..

[2]  Stefan Woltran,et al.  Complexity of semi-stable and stage semantics in argumentation frameworks , 2010, Inf. Process. Lett..

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

[4]  José Júlio Alferes,et al.  Scenario Semantics of Extended Logic Programs , 1993, LPNMR.

[5]  Didier Dubois,et al.  Argumentative inference in uncertain and inconsistent knowledge bases , 1993, UAI.

[6]  Martin Wigbertus Antonius Caminada.  Comparing Two Unique Extension Semantics for Formal Argumentation : Ideal and Eager , 2007 .

[7]  Bart Verheij,et al.  Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages , 1999 .

[8]  Pietro Baroni,et al.  On the resolution-based family of abstract argumentation semantics and its grounded instance , 2011, Artif. Intell..

[9]  Paul E. Dunne,et al.  Semi-stable semantics , 2006, J. Log. Comput..

[10]  Trevor J. M. Bench-Capon,et al.  Coherence in finite argument systems , 2002, Artif. Intell..

[11]  Pietro Baroni,et al.  Semantics of Abstract Argument Systems , 2009, Argumentation in Artificial Intelligence.

[12]  Pierre Marquis,et al.  Prudent semantics for argumentation frameworks , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

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

[14]  Paul E. Dunne,et al.  Computational properties of argument systems satisfying graph-theoretic constraints , 2007, Artif. Intell..

[15]  Yannis Dimopoulos,et al.  Graph theoretical structures in logic programs and default theories , 1996 .

[16]  Torsten Schaub,et al.  Signed Systems for Paraconsistent Reasoning , 1998, Journal of Automated Reasoning.

[17]  Pietro Baroni,et al.  On principle-based evaluation of extension-based argumentation semantics , 2007, Artif. Intell..

[18]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

[19]  Pietro Baroni,et al.  AFRA: Argumentation framework with recursive attacks , 2011, Int. J. Approx. Reason..

[20]  Paolo Mancarella,et al.  Computing ideal sceptical argumentation , 2007, Artif. Intell..