Abstract
We propose a simple and generic method for computing Dung’s standard argumentation semantics along with semi-stable semantics in Answer Set Programming (ASP). The different semantics captured by argumentation frameworks are all uniformly represented in our ASP setting. It is based on Caminada’s reinstatement labellings for argumentation frameworks as well as our method of computing circumscription in ASP. In our approach, a given argumentation framework is translated into a single normal logic program w.r.t. the chosen semantics whose answer set (if exists) yields an argument-based extension expressed by means of a reinstatement labelling for the semantics. We show soundness and completeness theorems for our translation, which allow us not only to compute argument-based extensions but also to decide whether an argument is sceptically or credulously accepted w.r.t. the chosen semantics. Based on our theorems, the prototype argumentation system was implemented using the ASP solver, DLV, whose evaluation results verified correctness of our approach.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 59–64 (2004)
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)
Caminada, M.: Semi-stable semantics. In: Proceedings of the first International Conference on Computational Models of Argument (COMMA 2006), pp. 121–130. IOS Press, Amsterdam (2006)
Cayrol, C., Doutre, S., Mengin, J.: On decision problems related to the preferred semantics for argumentation frameworks. Journal of Logic and Computation 13(3), 377–403 (2003)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77, 321–357 (1995)
Dung, P.M., Kowalski, R.A., Toni, F.: Dialectic proof procedures for assumption-based, admissible argumentation. Artificial Intelligence 170(2), 114–159 (2006)
Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artificial Intelligence 141, 187–203 (2002)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 364–375. Springer, Heidelberg (1997), http://www.dbai.tuwien.ac.at/proj/dlv/
Eiter, T., Polleres, A.: Towards automated integration of guess and check programs in answer set programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 100–113. Springer, Heidelberg (2004)
Egly, U., Woltran, S.: Reasoning in argumentation frameworks using quantified boolean formulas. In: Proceedings of the first International Conference on Computational Models of Argument (COMMA 2006), pp. 133–144. IOS Press, Amsterdam (2006)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the fifth International Conference and Symposium on Logic Programming (ICLP/SLP 1988), pp. 1070–1080. MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Lifschitz, V.: Computing circumscription. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI 1985), pp. 121–127 (1985)
McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence 28, 89–116 (1986)
Niemelä, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 421–430. Springer, Heidelberg (1997), http://www.tcs.hut.fi/Software/smodels/
Nieves, J.C., Cortes, U., Osorio, M.: Preferred extensions as stable models. Theory and Practice of Logic Programming 8(4), 527–543 (2008)
Prakken, H., Vreeswijk, G.A.W.: Logics for defeasible argumentation. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 4, pp. 218–319. Kluwer, Dordecht (2001)
Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123, 185–222 (2000)
Wakaki, T., Inoue, K., Sakama, C., Nitta, K.: Computing preferred answer sets in answer set programming. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol. 2850, pp. 259–273. Springer, Heidelberg (2003)
Wakaki, T., Inoue, K.: Compiling prioritized circumscription into answer set programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 356–370. Springer, Heidelberg (2004)
Wakaki, T., Tomita, T.: Circumscriptive theorem prover based on integration of guess and check program. Transactions of the Japanese Society for Artificial Intelligence, pp. 472–481 (2006); also the revised version is, Wakaki, T., Tomita, T.: Circumscriptive theorem prover based on integration of guess and check program. Transactions of the Japanese Society for Artificial Intelligence 22(5), 472–481 (2007) (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wakaki, T., Nitta, K. (2009). Computing Argumentation Semantics in Answer Set Programming. In: Hattori, H., Kawamura, T., Idé, T., Yokoo, M., Murakami, Y. (eds) New Frontiers in Artificial Intelligence. JSAI 2008. Lecture Notes in Computer Science(), vol 5447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00609-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-00609-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00608-1
Online ISBN: 978-3-642-00609-8
eBook Packages: Computer ScienceComputer Science (R0)