ABSTRACT
This work investigates an alternative characterization of semantics for Assumption-Based Argumentation (ABA) frameworks. The semantics of ABA frameworks are traditionally retrieved by the corresponding concepts of assumption extensions and assumption labellings, which only evaluate a subset of literals in the framework's language which are called assumptions. We argue about the interplay of non-assumptions in ABA frameworks and take inspiration from similarities between ABA and Logic Programming (LP) to propose new operations and semantic computation concerning ABA frameworks. To do so, we followed Przymusinski's work on Three-Valued Stable Models for LP to define interpretations and models for ABA frameworks (which also evaluate non-assumptions) and investigate whether this approach provides different results from the original. Amongst other results, we show that our complete model semantics is equivalent to the complete assumption labelling semantics for flat ABA frameworks, but the semi-stable model semantics is not equivalent to the semi-stable assumption labelling semantics.
- A. Bondarenko, P.M. Dung, R.A. Kowalski, and F. Toni. 1997. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence 93 (1997), 63--101. Google ScholarDigital Library
- M.W.A. Caminada. 2006. Semi-Stable Semantics. In Computational Models of Argument; Proceedings of COMMA 2006, P.E. Dunne and TJ.M. Bench-Capon (Eds.). IOS Press, 121--130. Google ScholarDigital Library
- Martin Caminada, Samy Sá, João Alcântara, and Wolfgang Dvorák. 2015. On the difference between assumption-based argumentation and abstract argumentation. IfCoLog Journal of Logics and their Applications 2 (2015), 15--34. http://www.collegepublications.co.uk/journals/ifcolog/?00003Google Scholar
- Martin Caminada, Samy Sá, João Alcântara, and Wolfgang Dvorák. 2015. On the equivalence between logic programming semantics and argumentation semantics. Int. J. Approx. Reasoning 58 (2015), 87--111. Google ScholarDigital Library
- Martin Caminada and Claudia Schulz. 2017. On the Equivalence between Assumption-Based Argumentation and Logic Programming. Journal of Artificial Intelligence Research 60 (2017), 779--825. Google ScholarDigital Library
- Robert Craven, Francesca Toni, and Matthew Williams. 2013. Graph-based dispute derivations in assumption-based argumentation. In International Workshop on Theorie and Applications of Formal Argumentation. Springer, 46--62.Google Scholar
- P.M. Dung. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77 (1995), 321--357. Google ScholarDigital Library
- P.M. Dung, R.A. Kowalski, and F. Toni. 2009. Assumption-Based Argumentation. In Argumentation in Artificial Intelligence, Guillermo Simari and Iyad Rahwan (Eds.). Springer US, 199--218.Google Scholar
- Th. Eiter, N. Leone, and D. Saccá. 1997. On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intell. 19, 1--2 (1997), 59--96. Google ScholarDigital Library
- Xiuyi Fan and Francesca Toni. 2015. On Computing Explanations in Argumentation. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25--30, 2015, Austin, Texas, USA., Blai Bonet and Sven Koenig (Eds.). AAAI Press, 1496--1502. http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9872 Google ScholarDigital Library
- Alejandro J. García and Guillermo R. Simari. 2004. Defeasible Logic Programming: An Argumentative Approach. Theory Pract. Log. Program. 4, 2 (jan 2004), 95--138. Google ScholarDigital Library
- Sanjay Modgil and Henry Prakken. 2013. A general account of argumentation with preferences. Artificial Intelligence 195 (2013), 361--397. Google ScholarDigital Library
- T.C. Przymusinski. 1990. The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. Fundamenta Informaticae 13, 4 (1990), 445--463. Google ScholarDigital Library
- Claudia Schulz and Francesca Toni. 2014. Complete Assumption Labellings.Google Scholar
- Claudia Schulz and Francesca Toni. 2017. Labellings for assumption-based and abstract argumentation. International Journal of Approximate Reasoning 84 (2017), 110--149. Google ScholarDigital Library
- Y. Wu, M.W.A. Caminada, and D.M. Gabbay. 2009. Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93, 1--2 (2009), 383--403. Special issue: new ideas in argumentation theory.Google ScholarCross Ref
Index Terms
- Interpretations and models for assumption-based argumentation
Recommendations
Assumption-Based Argumentation Is Logic Programming with Projection
Symbolic and Quantitative Approaches to Reasoning with UncertaintyAbstractWe revisit the semantic relations between Assumption-Based Argumentation (ABA) and Logic Programming (LP) based on the recent development of model-based semantics for ABA frameworks. This effort is motivated by the close resemblance between the ...
Computing ideal sceptical argumentation
We present two dialectic procedures for the sceptical ideal semantics for argumentation. The first procedure is defined in terms of dispute trees, for abstract argumentation frameworks. The second procedure is defined in dialectical terms, for ...
Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation
Logic and ArgumentationAbstractAssumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-...
Comments