Abstract
In this paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We note that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) can serve as a basis for describing various equivalences between logic programming semantics and argumentation semantics. In particular, we are able to provide a formal connection between regular semantics for logic programming and preferred semantics for formal argumentation. We also show that there exist logic programming semantics (L-stable semantics) that cannot be captured by any abstract argumentation semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 321–357 (1995)
Wu, Y., Caminada, M., Gabbay, D.: Complete extensions in argumentation coincide with 3-valued stable models in logic programming. Studia Logica 93(1-2), 383–403 (2009); Special issue: new ideas in argumentation theory
Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artificial Intelligence 171(5-6), 286–310 (2007)
Prakken, H.: An abstract framework for argumentation with structured arguments. Argument and Computation 1(2), 93–124 (2010)
Modgil, S., Prakken, H.: A general account of argumentation with preferences. Artificial Intellligence (in press, 2013)
Gorogiannis, N., Hunter, A.: Instantiating abstract argumentation with classical logic arguments: Postulates and properties. Artificial Intelligence 175(9-10), 1479–1497 (2011)
Caminada, M., Gabbay, D.: A logical account of formal argumentation. Studia Logica 93(2-3), 109–145 (2009); Special issue: new ideas in argumentation theory
Przymusinski, T.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13(4), 445–463 (1990)
Eiter, T., Leone, N., Saccá, D.: On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intell. 19(1-2), 59–96 (1997)
Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111–123. Springer, Heidelberg (2006)
Wu, Y., Caminada, M.: A labelling-based justification status of arguments. Studies in Logic 3(4), 12–29 (2010)
Caminada, M., Sá, S., Alcântara, J.: On the equivalence between logic programming semantics and argumentation semantics. Technical Report ABDN–CS–13–01, University of Aberdeen (2013)
Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Engineering Review 26(4), 365–410 (2011)
Pollock, J.: Cognitive Carpentry. A Blueprint for How to Build a Person. MIT Press, Cambridge (1995)
Jakobovits, H., Vermeir, D.: Robust semantics for argumentation frameworks. Journal of Logic and Computation 9(2), 215–261 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caminada, M., Sá, S., Alcântara, J. (2013). On the Equivalence between Logic Programming Semantics and Argumentation Semantics. In: van der Gaag, L.C. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2013. Lecture Notes in Computer Science(), vol 7958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39091-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-39091-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39090-6
Online ISBN: 978-3-642-39091-3
eBook Packages: Computer ScienceComputer Science (R0)