{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:04:51Z","timestamp":1725843891002},"publisher-location":"Singapore","reference-count":5,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811002809"},{"type":"electronic","value":"9789811002816"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-981-10-0281-6_3","type":"book-chapter","created":{"date-parts":[[2015,12,16]],"date-time":"2015-12-16T23:57:57Z","timestamp":1450310277000},"page":"15-21","source":"Crossref","is-referenced-by-count":0,"title":["Proving Sufficient Completeness of Constructor-Based Algebraic Specifications"],"prefix":"10.1007","author":[{"given":"Masaki","family":"Nakamura","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Gaina","sequence":"additional","affiliation":[]},{"given":"Kazuhiro","family":"Ogata","sequence":"additional","affiliation":[]},{"given":"Kokichi","family":"Futatsugi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,18]]},"reference":[{"key":"3_CR1","unstructured":"CafeOBJ. \n                  http:\/\/cafeobj.org\/"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2012.07.041","volume":"464","author":"Kokichi Futatsugi","year":"2012","unstructured":"Futatsugi, Kokichi, Gaina, Daniel, Ogata, Kazuhiro: Principles of proof scores in CafeOBJ. Theorem Computer Science 464, 90\u2013112 (2012)","journal-title":"Theorem Computer Science"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1093\/logcom\/exs044","volume":"25","author":"D Gaina","year":"2015","unstructured":"Gaina, D., Futatsugi, K.: Initial semantics in logics with constructors. Journal of Logic and Computation 25(1), 95\u2013116 (2015)","journal-title":"Journal of Logic and Computation"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01893885","volume":"28","author":"D Kapur","year":"1991","unstructured":"Kapur, D., et al.: Sufficient-completeness, ground-reducibility and their complexity. Acta Informatica 28, 311\u2013350 (1991)","journal-title":"Acta Informatica"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Schernhammer, F., Meseguer, J.: Incremental checking of well-founded recursive specifications modulo axioms. In: Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 5\u201316 (2011)","DOI":"10.1145\/2003476.2003481"}],"container-title":["Lecture Notes in Electrical Engineering","Advances in Computer Science and Ubiquitous Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-0281-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T20:18:24Z","timestamp":1559333904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-0281-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9789811002809","9789811002816"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-0281-6_3","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2015]]}}}