![]() Gabbay, Dov M. ![]() in Argumentation-based Proofs of Endearment (2019) Given a network (S,R) , with R ⊆ S2, we view the nodes of S as containing information and view xRy as x transmitting information to y. We argue that such networks provide a more general account of attack ... [more ▼] Given a network (S,R) , with R ⊆ S2, we view the nodes of S as containing information and view xRy as x transmitting information to y. We argue that such networks provide a more general account of attack and defense and general arguments exchange on issues between participants in Facebook and Twitter, as well as being able to simulate the traditional Dung approach. We define a general semantics for such networks. [less ▲] Detailed reference viewed: 46 (3 UL)![]() Gabbay, Dov M. ![]() in Logic Journal of the IGPL (2016), 24(5), 807--837 Detailed reference viewed: 161 (0 UL)![]() Gabbay, Dov M. ![]() in Computational Models of Argument - Proceedings of COMMA 2016, Potsdam Germany, 12-16 September, 2016. (2016) Detailed reference viewed: 44 (0 UL)![]() Gabbay, Dov M. ![]() in Logic Journal of the IGPL (2016), 24(2), 186--218 Detailed reference viewed: 155 (0 UL)![]() Gabbay, Dov M. ![]() in Logic Journal of the IGPL (2015), abs/1510.00077 Detailed reference viewed: 95 (6 UL) |
||