{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:22:37Z","timestamp":1760170957716,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_22","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"250-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Formal Theory of Justifications"],"prefix":"10.1007","author":[{"given":"Marc","family":"Denecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Brewka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Strass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"issue":"3","key":"22_CR1","first-page":"301","volume":"7","author":"N Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. TPLP 7(3), 301\u2013353 (2007)","journal-title":"TPLP"},{"issue":"3","key":"22_CR2","first-page":"355","volume":"7","author":"TC Son","year":"2007","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. TPLP 7(3), 355\u2013375 (2007)","journal-title":"TPLP"},{"doi-asserted-by":"crossref","unstructured":"Denecker, M., De Schreye, D.: Justification semantics: A unifying framework for the semantics of logic programs. In: LPNMR, pp. 365\u2013379. MIT Press (1993)","key":"22_CR3","DOI":"10.7551\/mitpress\/4307.003.0031"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-1-4615-1567-8_6","volume-title":"Logic-Based Artificial Intelligence","author":"M Denecker","year":"2000","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 127\u2013144. Springer, New York (2000)"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ic.2004.02.004","volume":"192","author":"M Denecker","year":"2004","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput. 192(1), 84\u2013121 (2004)","journal-title":"Inf. Comput."},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. Theoret. Comput. Sci. 27(1), 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR7","first-page":"59","volume":"5","author":"D Park","year":"1969","unstructured":"Park, D.: Fixpoint induction and proofs of program properties. Mach. Intell. 5, 59\u201378 (1969)","journal-title":"Mach. Intell."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-79719-7_20","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"M Mari\u00ebn","year":"2008","unstructured":"Mari\u00ebn, M., Wittocx, J., Denecker, M., Bruynooghe, M.: SAT(ID): satisfiability of propositional logic extended with inductive definitions. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 211\u2013224. Springer, Heidelberg (2008)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77, 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-74610-2_4","volume-title":"Logic Programming","author":"G Gupta","year":"2007","unstructured":"Gupta, G., Bansal, A., Min, R., Simon, L., Mallya, A.: Coinductive logic programming and its applications. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 27\u201344. Springer, Heidelberg (2007)"},{"issue":"4\u20136","key":"22_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1017\/S1471068410000293","volume":"10","author":"P Hou","year":"2010","unstructured":"Hou, P., De Cat, B., Denecker, M.: FO(FD): extending classical logic with rule-based fixpoint definitions. Theor. Pract. Log. Program. 10(4\u20136), 581\u2013596 (2010)","journal-title":"Theor. Pract. Log. Program."},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"MH van Emden","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733\u2013742 (1976)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"22_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M Fitting","year":"2002","unstructured":"Fitting, M.: Fixpoint semantics for logic programming: a survey. Theoret. Comput. Sci. 278(1\u20132), 25\u201351 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2013.09.004","volume":"205","author":"H Strass","year":"2013","unstructured":"Strass, H.: Approximating operators and semantics for abstract dialectical frameworks. Artif. Intell. 205, 39\u201370 (2013)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Fages, F.: A new fixpoint semantis for general logic programs compared with the well-founded and the stable model semantics. In: ICLP, p. 443. MIT Press (1990)","key":"22_CR17","DOI":"10.1007\/BF03037172"},{"unstructured":"Schulz, C., Toni, F.: ABA-based answer set justification. Theor. Pract. Log. Program. 13(4-5-Online-Supplement) (2013)","key":"22_CR18"},{"issue":"4\u20135","key":"22_CR19","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1017\/S1471068414000234","volume":"14","author":"P Cabalar","year":"2014","unstructured":"Cabalar, P., Fandinno, J., Fink, M.: Causal graph justifications of logic programs. Theor. Pract. Log. Program. 14(4\u20135), 603\u2013618 (2014)","journal-title":"Theor. Pract. Log. Program."},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1471068408003633","volume":"9","author":"E Pontelli","year":"2009","unstructured":"Pontelli, E., Son, T.C., Elkhatib, O.: Justifications for logic programs under answer set semantics. Theor. Pract. Log. Program. 9(1), 1\u201356 (2009)","journal-title":"Theor. Pract. Log. Program."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-40564-8_53","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Viegas Dam\u00e1sio","year":"2013","unstructured":"Viegas Dam\u00e1sio, C., Analyti, A., Antoniou, G.: Justifications for logic programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 530\u2013542. Springer, Heidelberg (2013)"},{"issue":"3\u20134","key":"22_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25(3\u20134), 369\u2013389 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0304-3975(06)80007-1","volume":"87","author":"L Halln\u00e4s","year":"1991","unstructured":"Halln\u00e4s, L.: Partial inductive definitions. Theor. Comp. Sci. 87(1), 115\u2013142 (1991)","journal-title":"Theor. Comp. Sci."},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","volume":"93","author":"A Bondarenko","year":"1997","unstructured":"Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93, 63\u2013101 (1997)","journal-title":"Artif. Intell."},{"unstructured":"Brewka, G., Woltran, S.: Abstract dialectical frameworks. In: KR, pp. 102\u2013111 (2010)","key":"22_CR25"},{"issue":"(4\u20135\u2013Online\u2013Sup","key":"22_CR26","first-page":"60","volume":"14","author":"B Bogaerts","year":"2014","unstructured":"Bogaerts, B., Vennekens, J., Denecker, M., Van den Bussche, J.: FO(C): a knowledge representation language of causality. TPLP 14((4\u20135\u2013Online\u2013Supplement)), 60\u201369 (2014)","journal-title":"TPLP"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T03:09:09Z","timestamp":1718075349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}