论文信息 - The Equational Approach to CF2 Semantics

The Equational Approach to CF2 Semantics

We introduce a family of new equational semantics for argumentation networks which can handle odd and even loops in a uniform manner. We offer one version of equational semantics which is equivalent to CF2 semantics, and a better version which gives the same results as traditional Dung semantics for even loops but can still handle odd loops.

Dov M. Gabbay

[1] D. M. Gabbaya. Equational approach to argumentation networks , 2012 .

[2] Stefan Woltran,et al. cf2 Semantics Revisited , 2010, COMMA.

[3] Dov M. Gabbay,et al. Fibring Argumentation Frames , 2009, Stud Logica.

[4] Pietro Baroni,et al. SCC-recursiveness: a general schema for argumentation semantics , 2005, Artif. Intell..

[5] Dov M. Gabbay,et al. The Handling of Loops in Talmudic Logic, with Application to Odd and Even Loops in Argumentation , 2014, HOWARD-60.

[6] Pietro Baroni,et al. An introduction to argumentation semantics , 2011, The Knowledge Engineering Review.

[7] Henry Prakken,et al. Logics for Defeasible Argumentation , 2001 .

[8] Pietro Baroni,et al. Solving Semantic Problems with Odd-Length Cycles in Argumentation , 2003, ECSQARU.

[9] Stefan Woltran,et al. The cf2 argumentation semantics revisited , 2013, J. Log. Comput..