{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:43Z","timestamp":1725663403258},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190271"},{"type":"electronic","value":"9783540389415"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19027-9_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:56:31Z","timestamp":1330199791000},"page":"378-379","source":"Crossref","is-referenced-by-count":2,"title":["CEC: A system for the completion of conditional equational specifications"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Bertling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"Ganzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renate","family":"Sch\u00e4fers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ganzinger, H.: Ground term confluence in parametric conditional equational specifications. Proc. STACS 1987, LNCS 247, 1987.","DOI":"10.1007\/BFb0039613"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Ganzinger, H.: A completion procedure for conditional equations. Report 234, U. Dortmund, 1987, to appear in Proc. 1st Int'l Workshop on Conditional Term Rewriting, LNCS, 1988.","DOI":"10.1007\/3-540-19242-5_6"},{"key":"27_CR3","first-page":"173","volume":"186","author":"D. Kapur","year":"1985","unstructured":"Kapur, D., Narendran, P., and Sivakumar, G.: A path ordering for proving termination of term rewrite systems. LNCS 186, 1985, 173\u2013187.","journal-title":"LNCS"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Ben Cherifa, A. and Lescanne, P.: An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations. Proc. CADE-8, LNCS 230, 1986.","DOI":"10.1007\/3-540-16780-3_78"}],"container-title":["Lecture Notes in Computer Science","ESOP '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19027-9_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:19:06Z","timestamp":1619558346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19027-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190271","9783540389415"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-19027-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}