{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:10:07Z","timestamp":1750198207543,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319509525"},{"type":"electronic","value":"9783319509532"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50953-2_15","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T10:07:32Z","timestamp":1491905252000},"page":"204-216","source":"Crossref","is-referenced-by-count":1,"title":["A Belief Revision Technique to Model Civil Code Updates"],"prefix":"10.1007","author":[{"given":"Ryuta","family":"Arisaka","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"CE Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C.E., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Log. 50, 510\u2013530 (1985)","journal-title":"J. Symb. Log."},{"key":"15_CR2","unstructured":"Arisaka, R.: How do you revise your belief set with %$;@*? arXiv e-prints:1504.05381 (2015)"},{"key":"15_CR3","unstructured":"Arisaka, R.: Latent belief theory and belief dependencies: a solution to the recovery problem in the belief set theories. arXiv e-prints: 1507.01425 (2015)"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(96)00038-0","volume":"89","author":"A Darwiche","year":"1997","unstructured":"Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artif. Intell. 89, 1\u201329 (1997)","journal-title":"Artif. Intell."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48159-1_23","volume-title":"Progress in Artificial Intelligence","author":"P Giusto","year":"1999","unstructured":"Giusto, P., Governatori, G.: A new approach to base revision. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 327\u2013341. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48159-1_23"},{"key":"15_CR6","unstructured":"Governatori, G., Palmirani, M., Riveret, R., Rotolo, A., Sartor, G.: Norm modifications in defeasible logic. In: JURIX, pp. 13\u201322 (2005)"},{"issue":"1","key":"15_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/jigpal\/jzp075","volume":"18","author":"G Governatori","year":"2010","unstructured":"Governatori, G., Rotolo, A.: Changing legal systems: legal abrogations and annulments in defeasible logic. Log. J. IGPL 18(1), 157\u2013194 (2010)","journal-title":"Log. J. IGPL"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Governatori, G., Rotolo, A., Olivieri, F., Scannapieco, S.: Legal contractions: a logical analysis. In: ICAIL, pp. 63\u201372 (2013)","DOI":"10.1145\/2514601.2514609"},{"key":"15_CR9","unstructured":"Ito, S.: Lecture Series on Ultimate Facts, Shojihomu (2008). (In Japanese)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Maranh\u00e3o, J.: Refinement. In: ICAIL, pp. 52\u201360 (2001)","DOI":"10.1145\/383535.383541"},{"issue":"3","key":"15_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","volume":"52","author":"H Katsuno","year":"1991","unstructured":"Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263\u2013294 (1991)","journal-title":"Artif. Intell."},{"key":"15_CR12","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., Asai, K., Kogawa, T., Kubota, M., Nakamura, M., Nishigai, Y., Shirakawa, K., Takano, C.: 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). doi: 10.1007\/978-3-642-25655-4_14"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Satoh, K., Kubota, M., Nishigai, Y., Takano, C.: Translating the Japanese presupposed ultimate fact theory into logic programming. In: JURIX, pp. 162\u2013171. IOS Press (2009)","DOI":"10.3233\/978-1-60750-082-7-162"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50953-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:50:05Z","timestamp":1750197005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50953-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319509525","9783319509532"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50953-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}