{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:10:19Z","timestamp":1745208619474,"version":"3.40.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00354-012-0402-6","type":"journal-article","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T10:03:39Z","timestamp":1352282619000},"page":"297-326","source":"Crossref","is-referenced-by-count":2,"title":["Logic Programming and Burden of Proof in Legal Reasoning"],"prefix":"10.1007","volume":"30","author":[{"given":"Ken","family":"Satoh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,8]]},"reference":[{"key":"402_CR1","first-page":"852","volume":"93","author":"P.M. Dung","year":"1993","unstructured":"Dung P.M.: \"On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming\u201d. Proc. of IJCAI-93, 852\u2013859 (1993)","journal-title":"Proc. of IJCAI-"},{"key":"402_CR2","first-page":"746","volume":"09","author":"P.M. Dung","year":"2009","unstructured":"Dung P.M., Dung T.M.: \u201cA Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation\u201d. Proc. of IJCAI-09, 746\u2013751 (2009)","journal-title":"Proc. of IJCAI-"},{"issue":"1-2","key":"402_CR3","first-page":"95","volume":"4","author":"A.J. Garci\u00e1","year":"2004","unstructured":"Garci\u00e1 A.J., Simari G.R.: \u201cDefeasible Logic Programming: An Argumentative Approach\u201d. TPLP 4(1-2), 95\u2013138 (2004)","journal-title":"TPLP"},{"issue":"10-15","key":"402_CR4","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.artint.2007.04.010","volume":"171","author":"T.F. Gordon","year":"2007","unstructured":"Gordon T.F., Prakken H., Walton D.: \u201cThe Carneades Model of Argument and Burden of Proof\u201d. Artif. Intell. 171(10-15), 875\u2013896 (2007)","journal-title":"Artif. Intell."},{"key":"402_CR5","unstructured":"Ito, S., Basis of Ultimate Facts, Yuhikaku, 2001 (in Japanese)."},{"key":"402_CR6","unstructured":"Ito, S., Lecture Series on Ultimate Facts, Shojihomu, 2008 (in Japanese)."},{"key":"402_CR7","unstructured":"Kitamura, I., \u201cThe Judiciary in Contemporary Society: Japan,\u201d Case Western Reserve Journal of International Law, 00087254, Sprint93, 25, 2, 1993."},{"key":"402_CR8","unstructured":"Kurata, T., \u201cShomei Sekininron,\u201d Hanrei Times (2001), Japanese translation of \u201cRosenberg, L., Die Beweislast auf der Grundlage des B\u00fcrgerlichen Gesetzbuchs und der Zivilprozessordnung (1956).\u201d"},{"key":"402_CR9","doi-asserted-by":"crossref","unstructured":"Modgil, S., Caminada, M., \u201cProof Theories and Algorithms for Abstract Argumentation Frameworks,\u201d Argumentation in AI (Rahwan, I. and Simari, G. R. eds.), Springer-Verlag, 2009.","DOI":"10.1007\/978-0-387-98197-0_6"},{"issue":"2-3","key":"402_CR10","first-page":"253","volume":"48","author":"H. Prakken","year":"2001","unstructured":"Prakken H.: \u201cModelling Defeasibility in Law: Logic or Procedure?\u201d. Fundam. Inform. 48(2-3), 253\u2013271 (2001)","journal-title":"Fundam. Inform."},{"key":"402_CR11","first-page":"21","volume":"2006","author":"H. Prakken","year":"2006","unstructured":"Prakken H., Sartor G.: \u201cPresumptions and Burdens of Proof\u201d. Proc. of JURIX 2006, 21\u201330 (2006)","journal-title":"Proc. of JURIX"},{"key":"402_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1276318.1276338","volume":"2007","author":"H. Prakken","year":"2007","unstructured":"Prakken H., Sartor G.: \u201cFormalising Arguments about the Burden of Persuasion\u201d. Proc. of ICAIL 2007, 97\u2013106 (2007)","journal-title":"Proc. of ICAIL"},{"key":"402_CR13","first-page":"176","volume":"2008","author":"H. Prakken","year":"2008","unstructured":"Prakken H., Sartor G.: \u201cMore on Presumptions and Burdens of Proof\u201d. Proc. of JURIX 2008, 176\u2013185 (2008)","journal-title":"Proc. of JURIX"},{"key":"402_CR14","unstructured":"Satoh, K., Tojo, S., Suzuki, Y., \u201cFormalizing a Switch of Burden of Proof by Logic Programming,\u201d Proc. of the 1st International Workshop on Juris-Informatics (JURISIN 2007), pp.76\u201385, 2007. ( http:\/\/research.nii.ac.jp\/\u02dcksatoh\/papers\/jurisin2007.pdf )"},{"key":"402_CR15","unstructured":"Satoh, K., \u201cFormalization of Burden of Proof and Its Surrounding Concepts by Logic Programming,\u201d The University of Tokyo Law Review, 4, pp.46\u201357, 2009 (in Japanese)."},{"key":"402_CR16","unstructured":"Satoh, K., \u201cA Formalization for Burden of Production in Logic Programming,\u201d Proc. of the 3rd International Workshop on Juris-informatics (JURISIN 2009), pp.107\u2013117, 2009."},{"key":"402_CR17","doi-asserted-by":"crossref","unstructured":"Satoh, K., Kubota, M., Nishigai, Y., Takano, C., \u201cTranslating the Japanese Presupposed Ultimate Fact Theory into Logic Programming,\u201d Proc. of JURIX 2009, pp.162\u2013171, 2009.","DOI":"10.3233\/978-1-60750-082-7-162"},{"key":"402_CR18","unstructured":"Satoh, K., Asai, K., Kogawa, T., Kubota, M., Nakamura, M., Nishigai, Y., Shirakawa, K., Takano, C., \u201cPROLEG: An Implementation of the Presupposed Ultimate Fact Theory of Japanese Civil Code by PROLOG Technology,\u201d Proc. of the 4th International Workshop on Juris-informatics (JURISIN 2010), pp.29\u201340, 2010."},{"key":"402_CR19","unstructured":"Shindo, K., New Civil Procedure Law (Revised 3rd Edition), Kobundo publisher, 2005 (in Japanese)."},{"key":"402_CR20","doi-asserted-by":"crossref","unstructured":"Yoshino, H., \u201cOn the Logical Foundations of Compound Predicate Formulae for Legal Knowledge Representation,\u201d Artificial Intelligence and Law, 5, 1-2, pp.77\u201396, Springer, 1997.","DOI":"10.1023\/A:1008289826410"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-012-0402-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-012-0402-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-012-0402-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T10:42:43Z","timestamp":1745145763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-012-0402-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s00354-012-0402-6","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}