{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T03:50:50Z","timestamp":1781927450654,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540582168","type":"print"},{"value":"9783540485735","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58216-9_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:36:25Z","timestamp":1330270585000},"page":"215-229","source":"Crossref","is-referenced-by-count":14,"title":["On conditional rewrite systems with extra variables and deterministic logic programs"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Avenhaus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Lor\u00eda-S\u00e1enz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"16_CR1","unstructured":"Avenhaus, J., Lor\u00eda-S\u00e1enz, C.: Canonical conditional rewrite systems containing extra variables, SEKI-Report SR-93-03, Univ. Kaiserslautern (1993)."},{"key":"16_CR2","first-page":"1","volume-title":"Formal Techniques in Artifical Intelligence","author":"J. Avenhaus","year":"1990","unstructured":"Avenhaus, J., Madlener, K.: Term rewriting and equational reasoning, in: R.B. Banerji, ed., Formal Techniques in Artifical Intelligence, North Holland, Amsterdam (1990), pp. 1\u201343."},{"key":"16_CR3","first-page":"45","volume":"355","author":"H. Bertling","year":"1989","unstructured":"Bertling, H., Ganzinger, H.: Completion-time optimization of rewrite-time goal solving, 3rd RTA (1989), LNCS 355, pp. 45\u201358.","journal-title":"LNCS"},{"key":"16_CR4","unstructured":"Comon, H.: Solving inequations in term algebras, 5th IEEE Symposium on Logic in Computer Science, LICS (1990), pp. 62\u201369."},{"key":"16_CR5","first-page":"180","volume":"202","author":"N. Dershowitz","year":"1985","unstructured":"Dershowitz, N.: Termination, 1st RTA (1985), LNCS 202, pp. 180\u2013224 and J. Symbolic Comp. 3 (1987), pp. 69\u2013116.","journal-title":"LNCS"},{"key":"16_CR6","unstructured":"Dershowitz, N.: Ordering-based strategies for Horn-clauses, 12th IJCAI (1991), pp. 118\u2013124."},{"key":"16_CR7","first-page":"241","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewriting systems, in J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam (1990), pp. 241\u2013320."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Okada, M.: A rationale for conditional equational programming, TCS 75 (1990), pp. 111\u2013138.","journal-title":"TCS"},{"key":"16_CR9","first-page":"31","volume":"308","author":"N. Dershowitz","year":"1988","unstructured":"Dershowitz, N., Okada, M., Sivakumar, G.: Confluence of conditional rewrite systems, 1st CTRS (1988), LNCS 308, pp. 31\u201344.","journal-title":"LNCS"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90105-Q","volume":"89","author":"H. Ganzinger","year":"1991","unstructured":"Ganzinger, H.: Order-sorted completion: the many-sorted way, TCS 89 (1991), pp. 3\u201332.","journal-title":"TCS"},{"key":"16_CR11","unstructured":"Geser, A.: On a monotonic semantic path ordering, Ulmer Informatik-Berichte No. 92-13, Universit\u00e4t Ulm (1992)."},{"key":"16_CR12","first-page":"430","volume":"656","author":"H. Ganzinger","year":"1992","unstructured":"Ganzinger, H., Waldmann, U.: Termination proofs of well-moded logic programs via conditional rewrite systems, 3rd CTRS (1992), LNCS 656, pp. 430\u2013437.","journal-title":"LNCS"},{"key":"16_CR13","first-page":"433","volume":"204","author":"N. Heck","year":"1985","unstructured":"Heck, N., Avenhaus, J.: On logic programs with data-driven computations, EUROCAL-85 (1985), LNCS 204, pp. 433\u2013443.","journal-title":"LNCS"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems, J. ACM 27 (1980), pp. 797\u2013821.","journal-title":"J. ACM"},{"key":"16_CR15","unstructured":"Kaplan, S.: Simplifying conditional term rewriting systems: Unification, termination and confluence, JSC (1987), pp. 295\u2013334."},{"key":"16_CR16","unstructured":"Lor\u00eda-S\u00e1enz, C.: A theoretical framework for reasoning about program construction based on extensions of rewrite systems, Dissetation, Univ. Kaiserslautern, 1993."},{"key":"16_CR17","unstructured":"Steinbach, J.: Private communication."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58216-9_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:12:55Z","timestamp":1619572375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58216-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582168","9783540485735"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58216-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}