22,348 Hits in 3.4 sec

An argument game for stable semantics

M. Caminada, Y. Wu
2008 Logic Journal of the IGPL  
In this paper, we present a discussion game for argumentation under stable semantics. Our work is inspired by Vreeswijk and Prakken, who have defined a similar game for preferred semantics.  ...  The nature of the resulting argument game is somewhat unusual, since stable semantics does not satisfy the property of relevance.  ...  The discussion game for credulous acceptance under stable semantics is then given in Section 4, and an approach for sceptical acceptance under stable semantics is given in Section 5.  ... 
doi:10.1093/jigpal/jzn029 fatcat:tkm6q32nbjaarjmzprkzd4lzqm

Proof Theories and Algorithms for Abstract Argumentation Frameworks [chapter]

Sanjay Modgil, Martin Caminada
2009 Argumentation in Artificial Intelligence  
Acknowledgements The authors would like to thank Gerard Vreeswijk for his contributions to the contents of this chapter. Thanks also to Nir Oren for commenting on a draft of the chapter.  ...  The result is an algorithm that calculates all stable extensions of a finite framework. Argument games for stable semantics have only recently been studied.  ...  Thus, for coherent argumentation frameworks, one can simply apply existing games for the preferred semantics to decide membership under stable semantics.  ... 
doi:10.1007/978-0-387-98197-0_6 fatcat:kc5vqztg7badff4nzhvv2xkkwq

Corruption and Audit in Strategic Argumentation [article]

Michael J. Maher
2020 arXiv   pre-print
Strategic argumentation provides a simple model of disputation and negotiation among agents.  ...  (Maher, 2016) introduced a model of corruption and resistance to corruption within strategic argumentation. In this paper we identify corrupt behaviours that are not detected in that formulation.  ...  Conclusion Raising the standard of play to require minimal moves makes exploitation of collusion more difficult because it eliminates an easy way to introduce arguments into the common pool.  ... 
arXiv:2008.13115v1 fatcat:y33ye4jnqjdildccqrma4lc3iy

What Is a Reasonable Argumentation Semantics? [chapter]

Sarah Alice Gaggl, Sebastian Rudolph, Michaël Thomazo
2015 Lecture Notes in Computer Science  
In view of the plethora of different argumentation semantics, we consider the question what the essential properties of a "reasonable" semantics are.  ...  We then challenge each of these proposals by exhibiting plausible semantics which still not satisfy our criteria, demonstrating the difficulty of our endeavor.  ...  As this Festschrift is dedicated to Gerd Brewka's 60 th birthday, we want to congratulate him as well as thank him for his inspiring work and the fruitful and enjoyable discussions.  ... 
doi:10.1007/978-3-319-14726-0_21 fatcat:fvfcteo4onh4je5tbssvyknxua

Applying Abstract Argumentation Theory to Cooperative Game Theory [article]

Anthony P. Young, David Kohan Marzagao, Josh Murphy
2020 arXiv   pre-print
Building on Dung's results in his seminal paper, we further the correspondence between Dung's four argumentation semantics and solution concepts in cooperative game theory by showing that complete extensions  ...  We then investigate the relationship between well-founded argumentation frameworks and convex games, where in each case the semantics (respectively, solution concepts) coincide; we prove that three-player  ...  Well-Founded Argumentation Frameworks Now recall from abstract argumentation theory we have a sufficient condition for an AF to have all four of Dung's argumentation semantics coincide.  ... 
arXiv:1905.10922v3 fatcat:iy4atw5dnfh7beurkusf7gbcjq

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Phan Minh Dung
1995 Artificial Intelligence  
This argument is based on a result showing that our theory captures naturally the solutions of the theory of n-person games and of the well-known stable marriage problem.  ...  We do so by first developing a theory for argumentation whose central notion is the acceptability of arguments.  ...  Though stable semantics is not defined for every argumentation system, an often asked question is whether or not argumentation systems with no stable extensions represent meaningful systems ???  ... 
doi:10.1016/0004-3702(94)00041-x fatcat:fagvcqzmurbh3jjm5zqhintsbq

Argumentation in the View of Modal Logic [chapter]

Davide Grossi
2011 Lecture Notes in Computer Science  
(calculi, model-checking games, bisimulation games); third, to import results (completeness of axiomatizations, complexity of model-checking, adequacy of games) from modal logic to argumentation theory  ...  This logic-driven analysis of argumentation allows: first, to systematize several results of argumentation theory reformulating them within suitable formal languages; second, to import several techniques  ...  The author wishes to thank Sanjay Modgil for the inspiring conversation that sparked this study.  ... 
doi:10.1007/978-3-642-21940-5_12 fatcat:6cg2jhhl7zcrbil2kizo7un5my

A Two-Phase Dialogue Game for Skeptical Preferred Semantics [chapter]

Zohreh Shams, Nir Oren
2016 Lecture Notes in Computer Science  
In this paper we propose a labelling based dialogue game for determining whether a single argument within a Dung argumentation framework is skeptically preferred.  ...  Correctness within this basic game requires perfect play by both players, and we therefore also introduce an overarching game to overcome this limitation.  ...  A Dialogue Game for skeptical Preferred Semantics We now describe a dialogical proof procedure for the skeptically preferred semantics.  ... 
doi:10.1007/978-3-319-48758-8_41 fatcat:7qra3wsjjfdw7mzoakb2aam6ci

Preferred semantics as socratic discussion

Martin W. A. Caminada, Wolfgang Dvořák, Srdjan Vesic
2014 Journal of Logic and Computation  
In abstract argumentation theory, preferred semantics has become one of the most popular approaches for determining the sets of arguments that can collectively be accepted.  ...  However, the description of preferred semantics, as it was originally stated by Dung, has a mainly technical and mathematical nature, making it difficult for lay persons to understand what the concept  ...  Acknowledgements We would like to thank Douglas Walton, Erik Krabbe and Richard Booth for their useful comments.  ... 
doi:10.1093/logcom/exu005 fatcat:y76dxsdsmzblnlysvuxpkam4qi

Implementing Ranking-Based Semantics in ConArg: a Preliminary Report [article]

Stafano Bistarelli, Francesco Faloci, Carlo Taticchi
2019 arXiv   pre-print
Such kind of semantics represents a method for sorting the arguments of an abstract argumentation framework, according to some preference relation.  ...  ConArg is a suite of tools that offers a wide series of applications for dealing with argumentation problems.  ...  semantics, and ii) verifying if an extension is conflict-free, admissible, or stable.  ... 
arXiv:1908.07784v2 fatcat:jfhi23yfmre5xampitay4euz7a

Measuring the Intensity of Attacks in Argumentation Graphs with Shapley Value

Leila Amgoud, Jonathan Ben-Naim, Srdjan Vesic
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
In an argumentation setting, a semantics evaluates the overall acceptability of arguments. Consequently, it reveals the global loss incurred by each argument due to attacks.  ...  Finally, it investigates the properties of the latter under existing semantics.  ...  In an argumentation context, each pair (S, A), with A = A, w, R , can be seen as a set of TU games (one per argument in A).  ... 
doi:10.24963/ijcai.2017/10 dblp:conf/ijcai/AmgoudBV17 fatcat:wpve4auf5ja2njerdhkmp7jrhm

Representing pure Nash equilibria in argumentation

Bruno Yun, Srdjan Vesic, Nir Oren
2021 Argument & Computation  
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria.  ...  Our approach builds on Modgil's Extended Argumentation Frameworks.  ...  Conclusions In this paper, we provided an argumentation-based interpretation of pure strategies in normal form games, demonstrating how argumentation semantics can be aligned with the Nash equilibrium  ... 
doi:10.3233/aac-210007 fatcat:qdbf37ka45cg3k6voutnv55gzy

On negation in Hilog

Kenneth A Ross
1994 The Journal of Logic Programming  
For example, in the game program of Example 6.3 the constraints needed are that game is at a level no higher than all its arguments, and that any argument of game is an acyclic binary relation.  ...  If game is at no higher level that its arguments, then it will not be in a higher component and will have its semantics computed "in time."  ... 
doi:10.1016/0743-1066(94)90040-x fatcat:wyrqj2v2kzatrknluuxxtze62u

Abstract argumentation and (optimal) stable marriage problems

Stefano Bistarelli, Francesco Santini
2019 Argument & Computation  
Dung set a wide scenario by connecting stable models in Logic and Game Theory to simple Abstract Argumentation Frameworks (AAF), which are essentially directed graphs in which arguments are represented  ...  Stable matchings correspond to stable extensions if an AAF is correctly generated from the given SM problem.  ...  Acknowledgements This work has been supported by the following two projects funded by the authors' Department: Argumentation 360 ("Ricerca di Base" 2017-2019) and "Rappresentazione della Conoscenza e Apprendimento  ... 
doi:10.3233/aac-190474 fatcat:cltmtieibzdvviqpblt23oizka

Argumentation and Game Theory [chapter]

Iyad Rahwan, Kate Larson
2009 Argumentation in Artificial Intelligence  
The Nash equilibria are the stable outcomes of the game.  ...  Game Semantics It is worth contrasting our work with work on so-called game semantics for logic, which was pioneered by logicians such as Paul Lorenzen [4] and Jaakko Hintikka [3] .  ... 
doi:10.1007/978-0-387-98197-0_16 fatcat:rnntjwndbffidp3gk47vwn3pbe
« Previous Showing results 1 — 15 out of 22,348 results