{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:00:53Z","timestamp":1747173653966,"version":"3.40.5"},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning; its most central concept is a justification: an explanation why a property holds (or does not hold) in a model.<\/jats:p><jats:p>In this paper, we continue the study of justification theory by means of three major contributions. The first is studying the relation between justification theory and game theory. We show that justification frameworks can be seen as a special type of games. The established connection provides the theoretical foundations for our next two contributions. The second contribution is studying under which condition two different dialects of justification theory (graphs as explanations vs trees as explanations) coincide. The third contribution is establishing a precise criterion of when a semantics induced by justification theory yields consistent results. In the past proving that such semantics were consistent took cumbersome and elaborate proofs.<\/jats:p><jats:p>We show that these criteria are indeed satisfied for all common semantics of logic programming.<\/jats:p>","DOI":"10.1017\/s1471068420000186","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T02:43:15Z","timestamp":1600742595000},"page":"880-894","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting Game Theory for Analysing Justifications"],"prefix":"10.1017","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2894-1377","authenticated-orcid":false,"given":"SIMON","family":"MARYNISSEN","sequence":"first","affiliation":[]},{"given":"BART","family":"BOGAERTS","sequence":"additional","affiliation":[]},{"given":"MARC","family":"DENECKER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"S1471068420000186_ref7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.apal.2007.10.004","article-title":"An infinite-game semantics for well-founded negation in logic programming","volume":"2","author":"Galanaki","year":"2008","journal-title":"Ann. Pure Appl. Log. 151,"},{"key":"S1471068420000186_ref4","doi-asserted-by":"crossref","unstructured":"4. Denecker, M. , Brewka, G. , and Strass, H. 2015. A formal theory of justifications. In Proceedings of LPNMR. 250\u2013264.","DOI":"10.1007\/978-3-319-23264-5_22"},{"key":"S1471068420000186_ref3","unstructured":"3. Denecker, M. 1993. Knowledge representation and reasoning in incomplete logic programming. Ph.D. thesis, K.U.Leuven, Leuven, Belgium."},{"key":"S1471068420000186_ref2","doi-asserted-by":"crossref","unstructured":"2. Bogaerts, B. and Weinzierl, A. 2018. Exploiting justifications for lazy grounding of answer set programs. In Proceedings of IJCAI. 1737\u20131745.","DOI":"10.24963\/ijcai.2018\/240"},{"key":"S1471068420000186_ref1","doi-asserted-by":"crossref","unstructured":"1. Blair, H. A. 1995. Game characterizations of logic program properties. In Proceedings of LPNMR. 99\u2013112.","DOI":"10.1007\/3-540-59487-6_8"},{"key":"S1471068420000186_ref17","first-page":"1","article-title":"Explanation in artificial intelligence: Insights from the social sciences","author":"Miller","year":"2019","journal-title":"AIJ 267"},{"key":"S1471068420000186_ref16","unstructured":"16. Marynissen, S. , Passchyn, N. , Bogaerts, B. , and Denecker, M. 2018. Consistency in justification theory. In Proceedings of NMR. 41\u201352."},{"key":"S1471068420000186_ref12","doi-asserted-by":"crossref","unstructured":"12. Lapauw, R. , Bruynooghe, M. , and Denecker, M. 2020. Improving parity game solvers with justifications. In Proceedings of VMCAI. 449\u2013470.","DOI":"10.1007\/978-3-030-39322-9_21"},{"key":"S1471068420000186_ref15","unstructured":"15. Marynissen, S. , Bogaerts, B. , and Denecker, M. 2020. Exploiting Game Theory for Analysing Justifications. arXiv e-prints, arXiv:2008.01609."},{"key":"S1471068420000186_ref10","doi-asserted-by":"crossref","unstructured":"10. Gimbert, H. and Zielonka, W. 2004. When can you play positionnaly? In Proceedings of MFCS. 686\u2013697.","DOI":"10.1007\/978-3-540-28629-5_53"},{"key":"S1471068420000186_ref8","doi-asserted-by":"crossref","unstructured":"8. Gebser, M. , Kaminski, R. , Kaufmann, B. , and Schaub, T. 2009. On the implementation of weight constraint rules in conflict-driven ASP solvers. In ICLP. 250\u2013264.","DOI":"10.1007\/978-3-642-02846-5_23"},{"key":"S1471068420000186_ref13","unstructured":"13. Loddo, J. and Cosmo, R. D. 2000. Playing logic programs with the alpha-beta algorithm. In Proceedings of LPAR. 207\u2013224."},{"key":"S1471068420000186_ref14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"2","author":"Martin","year":"1975","journal-title":"Annals of Mathematics 102"},{"key":"S1471068420000186_ref5","unstructured":"5. Denecker, M. , Marek, V. , and Truszczy\u0144ski, M. 2000. Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In Logic-Based Artificial Intelligence. 127\u2013144."},{"key":"S1471068420000186_ref6","first-page":"321","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","volume":"2","author":"Dung","year":"1995","journal-title":"AIJ 77"},{"key":"S1471068420000186_ref19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0743-1066(86)90003-8","article-title":"Quantitative deduction and its fixpoint theory","volume":"1","author":"van Emden","year":"1986","journal-title":"J. Log. Program. 3"},{"key":"S1471068420000186_ref11","doi-asserted-by":"crossref","unstructured":"11. Gimbert, H. and Zielonka, W. 2005. Games where you can play optimally without any memory. In Proceedings of CONCUR. 428\u2013442.","DOI":"10.1007\/11539452_33"},{"key":"S1471068420000186_ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31933-4_15","volume-title":"Gale-Stewart Games","author":"Soare","year":"2016"},{"key":"S1471068420000186_ref20","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"3","author":"Van Gelder","year":"1991","journal-title":"J. ACM 38"},{"key":"S1471068420000186_ref9","unstructured":"9. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP\/SLP. 1070\u20131080."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068420000186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T10:58:24Z","timestamp":1603105104000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000186\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,22]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["S1471068420000186"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000186","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2020,9,22]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}