{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:13Z","timestamp":1747173673374,"version":"3.40.5"},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker <jats:italic>et al.<\/jats:italic>, allow for the composition of justification systems. This notion of nesting thus enables the modular definition of semantics of rule-based languages, and increases the representational capacities of justification theory. As we show in this paper, the original characterization of semantics for nested justification systems leads to the loss of information relevant for explanations. In view of this problem, we provide an alternative characterization of their semantics and show that it is equivalent to the original one. Furthermore, we show how nested justification systems allow representing fixpoint definitions.<\/jats:p>","DOI":"10.1017\/s1471068422000266","type":"journal-article","created":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T08:22:10Z","timestamp":1657527730000},"page":"641-657","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["On Nested Justification Systems"],"prefix":"10.1017","volume":"22","author":[{"given":"SIMON","family":"MARYNISSEN","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3825-4052","authenticated-orcid":false,"given":"JESSE","family":"HEYNINCK","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3460-4251","authenticated-orcid":false,"given":"BART","family":"BOGAERTS","sequence":"additional","affiliation":[]},{"given":"MARC","family":"DENECKER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"S1471068422000266_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.04.004"},{"key":"S1471068422000266_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068422000126"},{"key":"S1471068422000266_ref14","first-page":"301","article-title":"Well-founded and stable semantics of logic programs with aggregates","volume":"3","author":"Pelov","year":"2007","journal-title":"TPLP 7"},{"key":"S1471068422000266_ref9","unstructured":"Marynissen, S. and Bogaerts, B. to appear. Tree-like justifications are consistent. In Technical Communications of ICLP."},{"key":"S1471068422000266_ref8","unstructured":"Marynissen, S. 2022. Advances in Justification Theory. Ph.D. thesis, Department of Computer Science, KU Leuven. Denecker, Marc and Bart Bogaerts (supervisors)."},{"key":"S1471068422000266_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.002"},{"key":"S1471068422000266_ref7","first-page":"581","article-title":"FO(FD): Extending classical logic with rule-based fixpoint definitions","volume":"4\u20136","author":"Hou","year":"2010","journal-title":"TPLP 10"},{"key":"S1471068422000266_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.11.007"},{"key":"S1471068422000266_ref3","unstructured":"Denecker, M. 1993. Knowledge Representation and Reasoning in Incomplete Logic Programming. Ph.D. thesis, K.U.Leuven, Leuven, Belgium."},{"key":"S1471068422000266_ref13","unstructured":"Marynissen, S. , Passchyn, N. , Bogaerts, B. and Denecker, M. 2018. Consistency in justification theory. In Proceedings of NMR, 41\u201352."},{"key":"S1471068422000266_ref4","doi-asserted-by":"crossref","unstructured":"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":"S1471068422000266_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000186"},{"key":"S1471068422000266_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068422000266"},{"key":"S1471068422000266_ref11","doi-asserted-by":"crossref","unstructured":"Marynissen, S. , Bogaerts, B. and Denecker, M. 2021. On the relation between approximation fixpoint theory and justification theory. In Proceedings of IJCAI, 1973\u20131980.","DOI":"10.24963\/ijcai.2021\/272"},{"key":"S1471068422000266_ref1","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Faber, W. and Gebser, M. 2021. Aggregate semantics for propositional answer set programs. CoRR, abs\/2109.08662.","DOI":"10.1017\/S1471068422000047"}],"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\/S1471068422000266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T01:07:35Z","timestamp":1660525655000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000266\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["S1471068422000266"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000266","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}