{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:22:21Z","timestamp":1768162941407,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031248405","type":"print"},{"value":"9783031248412","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-24841-2_17","type":"book-chapter","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:04:39Z","timestamp":1673222679000},"page":"261-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Jury-Trial Story Construction and\u00a0Analysis Using Goal-Directed Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Zesheng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4148-311X","authenticated-orcid":false,"given":"Joaqu\u00edn","family":"Arias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmer","family":"Salazar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4620-4266","authenticated-orcid":false,"given":"Sarat Chandra","family":"Varanasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8693-9307","authenticated-orcid":false,"given":"Kinjal","family":"Basu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9727-0362","authenticated-orcid":false,"given":"Gopal","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aravanis, T.I., Demiris, K., Peppas, P.: Legal reasoning in answer set programming. In: IEEE ICTAI 2018, pp. 302\u2013306. IEEE (2018)","DOI":"10.1109\/ICTAI.2018.00055"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Arias, J., Carro, M., Chen, Z., Gupta, G.: Justifications for goal-directed constraint answer set programming. In: Proceedings 36th International Conference on Logic Programming (Technical Communications). EPTCS, vol. 325, pp. 59\u201372. Open Publishing Association (2020). https:\/\/doi.org\/10.4204\/EPTCS.325.12","DOI":"10.4204\/EPTCS.325.12"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1017\/S1471068421000156","volume":"22","author":"J Arias","year":"2022","unstructured":"Arias, J., Carro, M., Chen, Z., Gupta, G.: Modeling and reasoning in event calculus using goal-directed constraint answer set programming. Theory Pract. Logic Program. 22(1), 51\u201380 (2022). https:\/\/doi.org\/10.1017\/S1471068421000156","journal-title":"Theory Pract. Logic Program."},{"issue":"3\u20134","key":"17_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S1471068418000285","volume":"18","author":"J Arias","year":"2018","unstructured":"Arias, J., Carro, M., Salazar, E., Marple, K., Gupta, G.: Constraint answer set programming without grounding. Theory Pract. Logic Program. 18(3\u20134), 337\u2013354 (2018). https:\/\/doi.org\/10.1017\/S1471068418000285","journal-title":"Theory Pract. Logic Program."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-030-85713-4_25","volume-title":"Advances in Artificial Intelligence","author":"J Arias","year":"2021","unstructured":"Arias, J., Moreno-Rebato, M., Rodriguez-Garc\u00eda, J.A., Ossowski, S.: Modeling administrative discretion using goal-directed answer set programming. In: Alba, E., et al. (eds.) CAEPIA 2021. LNCS (LNAI), vol. 12882, pp. 258\u2013267. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85713-4_25"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1017\/S1471068422000138","volume":"22","author":"J Arias","year":"2022","unstructured":"Arias, J., T\u00f6rm\u00e4, S., Carro, M., Gupta, G.: Building information modeling using constraint logic programming. Theory Pract. Logic Program. 22(5), 723\u2013738 (2022). https:\/\/doi.org\/10.1017\/S1471068422000138","journal-title":"Theory Pract. Logic Program."},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"17_CR8","volume-title":"Reconstructing Reality in the Courtroom","author":"W Bennett","year":"1981","unstructured":"Bennett, W., Feldman, M.: Reconstructing Reality in the Courtroom. Rutgers University Press, New Brunswick (1981)"},{"key":"17_CR9","unstructured":"Bonatti, P.A., Pontelli, E., Son, T.C.: Credulous resolution for answer set programming. In: Proceedings of the AAAI 2008, pp. 418\u2013423. AAAI Press (2008)"},{"issue":"12","key":"17_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"5\u20136","key":"17_CR11","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1017\/S1471068416000478","volume":"16","author":"S Costantini","year":"2016","unstructured":"Costantini, S., Formisano, A.: Query answering in resource-based answer set semantics. Theory Pract. Log. Program. 16(5\u20136), 619\u2013635 (2016)","journal-title":"Theory Pract. Log. Program."},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/0199246297.001.0001","volume-title":"Inquiries into Truth and Interpretation: Philosophical Essays","author":"D Davidson","year":"2001","unstructured":"Davidson, D.: Inquiries into Truth and Interpretation: Philosophical Essays, vol. 2. Oxford University Press, Oxford (2001)"},{"key":"17_CR13","first-page":"163","volume":"1","author":"E Elwork","year":"1977","unstructured":"Elwork, E., Sales, B., Alfini, J.: Juridic decisions: in ignorance of the law or in light of it? Cogn. Sci. 1, 163\u2013189 (1977)","journal-title":"Cogn. Sci."},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/logcom\/exn040","volume":"19","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Gharib, M., Mercer, R.E., Schaub, T.: Monotonic answer set programming. J. Log. Comput. 19(4), 539\u2013564 (2009)","journal-title":"J. Log. Comput."},{"key":"17_CR15","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: preliminary report. arXiv 1405.3694 (2014). https:\/\/arxiv.org\/abs\/1405.3694"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the Potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"key":"17_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach","author":"M Gelfond","year":"2014","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press, Cambridge (2014)"},{"key":"17_CR18","unstructured":"Gupta, G., et al.: Tutorial: automating commonsense reasoning. In: ICLP Workshops. CEUR Workshop Proceedings, vol. 3193. CEUR-WS.org (2022)"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10506-021-09295-3","volume":"30","author":"R Kowalski","year":"2022","unstructured":"Kowalski, R., Datoo, A.: Logical English meets legal English for swaps and derivatives. Artif. Intell. Law 30(2), 163\u2013197 (2022)","journal-title":"Artif. Intell. Law"},{"key":"17_CR20","unstructured":"Marple, K., Salazar, E., Gupta, G.: Computing stable models of normal logic programs without grounding. arXiv preprint arXiv:1709.00501 (2017)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Morris, J.: Constraint answer set programming as a tool to improve legislative drafting: a rules as code experiment. In: ICAIL, pp. 262\u2013263. ACM (2021)","DOI":"10.1145\/3462757.3466084"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1207\/s15516709cog1301_1","volume":"13","author":"N Pennington","year":"1989","unstructured":"Pennington, N., Hastie, R.: The logic of plausible reasoning: a core theory. Cogn. Sci. 13, 1\u201349 (1989)","journal-title":"Cogn. Sci."},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1037\/0022-3514.62.2.189","volume":"62","author":"N Pennington","year":"1992","unstructured":"Pennington, N., Hastie, R.: Explaining the evidence: tests of the story model for juror decision making. J. Pers. Soc. Psychol. 62(2), 189 (1992)","journal-title":"J. Pers. Soc. Psychol."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0010-0277(93)90038-W","volume":"49","author":"N Pennington","year":"1993","unstructured":"Pennington, N., Hastie, R.: Reasoning in explanation-based decision making. Cognition 49, 123\u2013163 (1993)","journal-title":"Cognition"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-25655-4_14","volume-title":"New Frontiers in Artificial Intelligence","author":"K Satoh","year":"2011","unstructured":"Satoh, K., et al.: PROLEG: an implementation of the presupposed ultimate fact theory of Japanese civil code by PROLOG technology. In: Onada, T., Bekki, D., McCready, E. (eds.) JSAI-isAI 2010. LNCS (LNAI), vol. 6797, pp. 153\u2013164. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25655-4_14"},{"key":"17_CR26","unstructured":"Wielemaker, J., Arias, J., Gupta, G.: s(CASP) for SWI-Prolog. In: Proceedings of the 37th ICLP 2021 Workshops, vol. 2970. CEUR-WS.org (2021). http:\/\/ceur-ws.org\/Vol-2970\/gdeinvited4.pdf"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24841-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T14:10:00Z","timestamp":1673273400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24841-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248405","9783031248412"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24841-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston , MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl23.sigplan.org\/home\/PADL-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}