×

On the equivalence between abstract dialectical frameworks and logic programs. (English) Zbl 1434.68553

Summary: Abstract Dialectical Frameworks (ADFs) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a translation from Normal Logic Programs (NLPs) to ADFs and proved the stable models semantics for a normal logic program has an equivalent semantics to that of the corresponding ADF. However, these studies failed in identifying a semantics for ADFs equivalent to a three-valued semantics (as partial stable models and well-founded models) for NLPs. In this work, we focus on a fragment of ADFs, called Attacking Dialectical Frameworks \((\mathit{ADF}^+\)s), and provide a translation from NLPs to \(\mathit{ADF}^+\)s robust enough to guarantee the equivalence between partial stable models, well-founded models, regular models, stable models semantics for NLPs and respectively complete models, grounded models, preferred models, stable models for ADFs. In addition, we define a new semantics for \(\mathit{ADF}^+\)s, called \(L\)-stable, and show it is equivalent to the \(L\)-stable semantics for NLPs.

MSC:

68T27 Logic in artificial intelligence
68N17 Logic programming
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Bondarenko, A., Dung, P. M., Kowalski, R. A., and Toni, F.1997. An abstract, argumentation-theoretic approach to default reasoning. Art. Intelligence 93,1-2, 63-101. · Zbl 1017.03511
[2] Brass, S. and Dix, J.1995. Characterizations of the stable semantics by partial evaluation. In International Conf. on Logic Programming and Nonmonotonic Reasoning. Springer, 85-98. · Zbl 0883.68082
[3] Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J. P., and Woltran, S.2013. Abstract dialectical frameworks revisited. In Proceedings of the Twenty-Third international joint conference on Artificial Intelligence. AAAI Press, 803-809.
[4] Brewka, G. and Woltran, S.2010. Abstract dialectical frameworks. In Twelfth International Conf. on the Principles of Knowledge Representation and Reasoning. AAAI Press, 102-111.
[5] Buss, S. R.1987. The boolean formula value problem is in alogtime. In Proceedings of the nineteenth annual ACM symposium on Theory of computing. ACM, 123-131.
[6] Caminada, M.2006. Semi-stable semantics. 1st International Conference on Computational Models of Argument (COMMA) 144, 121-130.
[7] Caminada, M., Sá, S., Alcântara, J., and Dvořák, W.2015a. On the equivalence between logic programming semantics and argumentation semantics. International Journal of Approximate Reasoning 58, 87-111. · Zbl 1328.68211
[8] Caminada, M. and Schulz, C.2017. On the equivalence between assumption-based argumentation and logic programming. Journal of Artificial Intelligence Research 60, 779-825. · Zbl 1423.68480
[9] Caminada, M. W. A., Sá, S., Alcântara, J., and Dvořák, W.2015b. On the difference between assumption-based argumentation and abstract argumentation. IfCoLog Journal of Logics and their Applications. · Zbl 1328.68211
[10] Dung, P.1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 321-357. · Zbl 1013.68556
[11] Dung, P. M., Kowalski, R. A., and Toni, F.2009. Assumption-based argumentation. In Argumentation in artificial intelligence. Springer, 199-218.
[12] Eiter, T., Leone, N., and Saccá, D.1997. On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intell. 19,1-2, 59-96. · Zbl 0880.68029
[13] Ellmauthaler, S.2012. Abstract Dialectical Frameworks: Properties, Complexity, and Implementation. M.S. thesis, Technische Universität Wien, Institut für Informationssysteme.
[14] Gelfond, M. and Lifschitz, V.1988. The stable model semantics for logic programming. In Proc. of the 5th International Conference on Logic Programming (ICLP). Vol. 88. 1070-1080.
[15] Kleene, S. C., de Bruijn, N., de Groot, J., and Zaanen, A. C.1952. Introduction to metamathematics. Vol. 483. van Nostrand New York. · Zbl 0047.00703
[16] Nielsen, S. H. and Parsons, S.2006. A generalization of Dungs abstract framework for argumentation: Arguing with sets of attacking arguments. In International Workshop on Argumentation in Multi-Agent Systems. Springer, 54-73. · Zbl 1429.68266
[17] Polberg, S.2016. Understanding the abstract dialectical framework. In European Conference on Logics in Artificial Intelligence. Springer, 430-446. · Zbl 1483.68384
[18] Prakken, H. and Sartor, G.1997. Argument-based extended logic programming with defeasible priorities. Journal of applied non-classical logics 7, 1-2, 25-75. · Zbl 0877.68019
[19] Przymusinski, T. C.1990. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13, 4, 445-463. · Zbl 0706.68029
[20] Schulz, C. and Toni, F.2015. Logic programming in assumption-based argumentation revisited-semantics and graphical representation. In 29th AAAI Conf. on Art. Intelligence.
[21] Simari, G. R. and Loui, R. P.1992. A mathematical treatment of defeasible reasoning and its implementation. Artificial intelligence 53, 2-3, 125-157. · Zbl 1193.68238
[22] Strass, H.2013. Approximating operators and semantics for abstract dialectical frameworks. Artificial Intelligence 205, 39-70. · Zbl 1334.68212
[23] Toni, F.2014. A tutorial on assumption-based argumentation. Argument & Computation 5, 1, 89-117.
[24] Wu, Y., Caminada, M., and Gabbay, D. M.2009. Complete extensions in argumentation coincide with 3-valued stable models in logic programming. Studia logica 93, 2-3, 383. · Zbl 1189.68127
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.