{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:32:31Z","timestamp":1726054351404},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030316044"},{"type":"electronic","value":"9783030316051"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31605-1_12","type":"book-chapter","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T16:41:22Z","timestamp":1570725682000},"page":"146-159","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Legal Debugging in Propositional Legal Representation"],"prefix":"10.1007","author":[{"given":"Wachara","family":"Fungwacharakorn","sequence":"first","affiliation":[]},{"given":"Ken","family":"Satoh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/5689.5920","volume":"29","author":"MJ Sergot","year":"1986","unstructured":"Sergot, M.J., Sadri, F., Kowalski, R.A., Kriwaczek, F., Hammond, P., Cory, H.T.: The British Nationality Act as a logic program. Commun. ACM 29, 370\u2013386 (1986)","journal-title":"Commun. ACM"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Sherman, D.M.: A Prolog model of the income tax act of Canada. In: Proceedings of the 1st International Conference on Artificial Intelligence and Law, pp. 127\u2013136. ACM, New York (1987)","DOI":"10.1145\/41735.41750"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-39931-2_13","volume-title":"New Frontiers in Artificial Intelligence","author":"T Li","year":"2013","unstructured":"Li, T., Balke, T., De Vos, M., Satoh, K., Padget, J.: Detecting conflicts in legal systems. In: Motomura, Y., Butler, A., Bekki, D. (eds.) JSAI-isAI 2012. LNCS (LNAI), vol. 7856, pp. 174\u2013189. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39931-2_13"},{"key":"12_CR4","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":"12_CR5","unstructured":"Ito, S.: Lecture Series on Ultimate Facts. Shojihomu (2008). (in Japanese)"},{"key":"12_CR6","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J Ullman","year":"1988","unstructured":"Ullman, J.: Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville (1988)"},{"key":"12_CR7","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: International Conference on Logic Programming\/Joint International Conference and Symposium on Logic Programming, pp. 1070\u20131080 (1988)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF03037172","volume":"9","author":"F Fages","year":"1991","unstructured":"Fages, F.: A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Gener. Comput. 9, 425\u2013443 (1991)","journal-title":"New Gener. Comput."},{"key":"12_CR9","unstructured":"Satoh, K., Kogawa, T., Okada, N., Omori, K., Omura, S., Tsuchiya, K.: On generality of PROLEG knowledge representation. In: Proceedings of the 6th International Workshop on Juris-informatics (JURISIN 2012), Miyazaki, Japan, pp. 115\u2013128 (2012)"},{"key":"12_CR10","unstructured":"Tokyo High Court: Case to seek removal of a building and surrender of lands. 1994 (O) 693. Minshu, vol. 50, no. 9 (1996)"},{"key":"12_CR11","unstructured":"Syrj\u00e4nen, T.: Debugging inconsistent answer set programs. In: Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pp. 77\u201383 (2006)"},{"key":"12_CR12","unstructured":"Caminada, M., Sakama, C.: On the existence of answer sets in normal extended logic programs. In: Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence, Riva Del Garda, Italy, pp. 743\u2013744. IOS Press, Amsterdam (2006)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-319-23264-5_39","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Schulz","year":"2015","unstructured":"Schulz, C., Satoh, K., Toni, F.: Characterising and explaining inconsistency in logic programs. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 467\u2013479. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_39"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-48758-8_42","volume-title":"Logics in Artificial Intelligence","author":"M Ulbricht","year":"2016","unstructured":"Ulbricht, M., Thimm, M., Brewka, G.: Measuring inconsistency in answer set programs. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 577\u2013583. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_42"},{"key":"12_CR15","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. Pr. Log. Program. 9, 1\u201356 (2009)","journal-title":"Theor. Pr. Log. Program."},{"key":"12_CR16","unstructured":"Gebser, M., P\u00fchrer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: Proceedings of the 23rd National Conference on Artificial Intelligence \u2013 vol. 1, pp. 448\u2013453. AAAI Press (2008)"},{"key":"12_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"EY Shapiro","year":"1983","unstructured":"Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"60:1","DOI":"10.1145\/3106740","volume":"50","author":"R Caballero","year":"2017","unstructured":"Caballero, R., Riesco, A., Silva, J.: A survey of algorithmic debugging. ACM Comput. Surv. 50, 60:1\u201360:35 (2017)","journal-title":"ACM Comput. Surv."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-40942-4_24","volume-title":"KI 2013: Advances in Artificial Intelligence","author":"C Zinn","year":"2013","unstructured":"Zinn, C.: Algorithmic debugging for intelligent tutoring: How to use multiple models and improve diagnosis. In: Timm, I.J., Thimm, M. (eds.) KI 2013. LNCS (LNAI), vol. 8077, pp. 272\u2013283. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40942-4_24"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/BFb0019419","volume-title":"Automated and Algorithmic Debugging","author":"K Kuchcinski","year":"1993","unstructured":"Kuchcinski, K., Drabent, W., Maluszynski, J.: Automatic diagnosis of VLSI digital circuits using algorithmic debugging. In: Fritzson, P.A. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 350\u2013367. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0019419"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1017\/S1471068418000534","volume":"19","author":"J Fandinno","year":"2019","unstructured":"Fandinno, J., Schulz, C.: Answering the \u201cwhy\u201d in answer set programming \u2013 a survey of explanation approaches. Theor. Pract. Log. Program. 19, 114\u2013203 (2019)","journal-title":"Theor. Pract. Log. Program."},{"key":"12_CR22","unstructured":"Brain, M., De Vos, M.: Debugging logic programs under the answer set semantics. In: Answer Set Programming (2005)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1017\/S1471068410000256","volume":"10","author":"J Oetsch","year":"2010","unstructured":"Oetsch, J., P\u00fchrer, J., Tompits, H.: Catching the ouroboros: on debugging non-ground answer-set programs. Theor. Pract. Log. Program. 10, 513\u2013529 (2010)","journal-title":"Theor. Pract. Log. Program."},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-20895-9_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Oetsch","year":"2011","unstructured":"Oetsch, J., P\u00fchrer, J., Tompits, H.: Stepping through an answer-set program. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 134\u2013147. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_13"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-88594-8_8","volume-title":"Semantics in Data and Knowledge Bases","author":"R Caballero","year":"2008","unstructured":"Caballero, R., Garc\u00eda-Ruiz, Y., S\u00e1enz-P\u00e9rez, F.: A theoretical framework for the declarative debugging of datalog programs. In: Schewe, K.D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 143\u2013159. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88594-8_8"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31605-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T20:59:42Z","timestamp":1721854782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31605-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030316044","9783030316051"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31605-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JSAI-isAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"JSAI International Symposium on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yokohama","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsai2018a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ai-gakkai.or.jp\/isai\/isai2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind\/Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"97","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":"28","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":"5","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":"29% - 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":"2-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":"2-3","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)"}}]}}