{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:53Z","timestamp":1725663533244},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540192428"},{"type":"electronic","value":"9783540391661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19242-5_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:05:26Z","timestamp":1330182326000},"page":"91-97","source":"Crossref","is-referenced-by-count":9,"title":["Notes on the elimination of conditions"],"prefix":"10.1007","author":[{"given":"E.","family":"Giovannetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Moiso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J. A. Bergstra","year":"1986","unstructured":"J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, Journal of Computer and System Sciences 32 (1986), pp. 323\u2013362.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR2","unstructured":"P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi, A complete characterization of K-LEAF, a logic language with partial functions, Proc. 1987 Symp. on Logic Programming (IEEE Comp. Society Press, 1987)."},{"key":"8_CR3","volume-title":"Equational programming, Report R-86-1265","author":"N. Dershowitz","year":"1986","unstructured":"N. Dershowitz and D.A. Plaisted, Equational programming, Report R-86-1265, University of Illinois, Urbana (1986)."},{"key":"8_CR4","unstructured":"S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984)."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19242-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:20:17Z","timestamp":1619544017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19242-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540192428","9783540391661"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-19242-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}