{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:07:43Z","timestamp":1715645263389},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Riveret <jats:italic>et al<\/jats:italic>. have proposed a framework for probabilistic legal reasoning. Their goal is to determine the chance of winning a court case, given the probabilities of the judge accepting certain claimed facts and legal rules.<\/jats:p><jats:p>In this paper we tackle the same problem by defining and implementing a new formalism, called probabilistic argumentation logic, which can be seen as a probabilistic generalization of Nute's defeasible logic. Not only does this provide an automation of the \u2014 only hand-performed \u2014 computations in Riveret et al, it also provides a solution to one of their open problems: a method to determine the initial probabilities from a given body of precedents.<\/jats:p>","DOI":"10.1017\/s1471068413000483","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"769-781","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic legal reasoning in CHRiSM"],"prefix":"10.1017","volume":"13","author":[{"given":"JON","family":"SNEYERS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DANNY","family":"DE SCHREYE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"THOM","family":"FR\u00dcHWIRTH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000483_ref14","first-page":"431","volume-title":"ICLP 2004","author":"Vennekens","year":"2004"},{"key":"S1471068413000483_ref13","first-page":"1","article-title":"As time goes by: Constraint Handling Rules.","volume":"10","author":"Sneyers","year":"2010","journal-title":"TPLP"},{"key":"S1471068413000483_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-008-0062-7"},{"key":"S1471068413000483_ref6","unstructured":"Nute D. 2001. Defeasible logic: Theory, implementation, and applications. In Proceedings of 14th International Conference on Applications of Prolog (INAP 2001), 87\u2013114."},{"key":"S1471068413000483_ref5","first-page":"235","article-title":"On the implementation of the probabilistic logic programming language ProbLog","volume":"11","author":"Kimmig","year":"2011","journal-title":"TPLP"},{"key":"S1471068413000483_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068413000483_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886"},{"key":"S1471068413000483_ref7","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.1997.10510900"},{"key":"S1471068413000483_ref11","unstructured":"Sneyers J. , De Schreye D. and Fr\u00fchwirth T. 2013. CHRiSM and probabilistic argumentation logic. In CHR 2013, 10th International Workshop on Constraint Handling Rules."},{"key":"S1471068413000483_ref12","first-page":"433","article-title":"CHR(PRISM)-based probabilistic logic learning.","volume":"10","author":"Sneyers","year":"2010","journal-title":"TPLP"},{"key":"S1471068413000483_ref9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1276318.1276333","volume-title":"ICAIL","author":"Roth","year":"2007"},{"key":"S1471068413000483_ref8","first-page":"99","article-title":"Success chances in argument games: a probabilistic approach to legal disputes","volume":"165","author":"Riveret","year":"2007","journal-title":"JURIX"},{"key":"S1471068413000483_ref3","volume-title":"Constraint Handling Rules: Compilation, Execution, and Analysis","author":"Fr\u00fchwirth","year":"2011"},{"key":"S1471068413000483_ref4","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.6.719"}],"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\/S1471068413000483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:29:19Z","timestamp":1715592559000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000483\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":14,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000483"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000483","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}