Characterizing Strong Equivalence for Argumentation Frameworks
暂无分享,去创建一个
[1] Pietro Baroni,et al. Semantics of Abstract Argument Systems , 2009, Argumentation in Artificial Intelligence.
[2] Guillermo Ricardo Simari,et al. Argumentation in Artificial Intelligence , 2009 .
[3] Miroslaw Truszczynski,et al. Strong and uniform equivalence of nonmonotonic theories – an algebraic approach , 2006, Annals of Mathematics and Artificial Intelligence.
[4] Stefan Woltran,et al. Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets , 2011, ECSQARU.
[5] Stefan Woltran,et al. Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.
[6] Pietro Baroni,et al. On the resolution-based family of abstract argumentation semantics and its grounded instance , 2011, Artif. Intell..
[7] Guido Boella,et al. Dynamics in argumentation with single extensions: attack refinement and the grounded extension , 2009, AAMAS.
[8] Sébastien Konieczny,et al. On the merging of Dung's argumentation systems , 2007, Artif. Intell..
[9] Paul E. Dunne,et al. The computational complexity of ideal semantics , 2009, Artif. Intell..
[10] Ringo Baumann,et al. Expanding Argumentation Frameworks: Enforcing and Monotonicity Results , 2010, COMMA.
[11] Trevor J. M. Bench-Capon,et al. Argumentation in artificial intelligence , 2007, Artif. Intell..
[12] Claudette Cayrol,et al. Change in Abstract Argumentation Frameworks: Adding an Argument , 2010, J. Artif. Intell. Res..
[13] 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..
[14] Paul E. Dunne,et al. Semi-stable semantics , 2006, J. Log. Comput..
[15] Tomi Janhunen,et al. Achieving compositionality of the stable model semantics for smodels programs1 , 2008, Theory and Practice of Logic Programming.
[16] Pietro Baroni,et al. SCC-recursiveness: a general schema for argumentation semantics , 2005, Artif. Intell..
[17] David Pearce,et al. Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..
[18] Guido Boella,et al. Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension , 2009, ECSQARU.
[19] Stefan Woltran,et al. A common view on strong, uniform, and other notions of equivalence in answer-set programming* , 2007, Theory and Practice of Logic Programming.
[20] Anthony Hunter,et al. Instantiating abstract argumentation with classical logic arguments: Postulates and properties , 2011, Artif. Intell..
[21] Paolo Mancarella,et al. Computing ideal sceptical argumentation , 2007, Artif. Intell..
[22] Guillermo Ricardo Simari,et al. Argument Theory Change: Revision Upon Warrant , 2008, COMMA.
[23] Martin Caminada,et al. On the Issue of Reinstatement in Argumentation , 2006, JELIA.
[24] Guillermo Ricardo Simari,et al. Belief Revision and Argumentation Theory , 2009, Argumentation in Artificial Intelligence.
[25] Claudette Cayrol,et al. Revision of an Argumentation System , 2008, KR.
[26] Floris Bex,et al. Computational Models of Argument, Proceedings of COMMA , 2008, COMMA 2008.
[27] Miroslaw Truszczynski,et al. On graph equivalences preserved under extensions , 2011, Discret. Math..