{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:25Z","timestamp":1725663505131},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543176"},{"type":"electronic","value":"9783540475583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54317-1_77","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:39:48Z","timestamp":1330209588000},"page":"1-13","source":"Crossref","is-referenced-by-count":4,"title":["Conditional rewriting in focus"],"prefix":"10.1007","author":[{"given":"Francois","family":"Bronsard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uday S.","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-51081-8_97","volume-title":"Rewriting Techniques and Appl.","author":"L. Bachmair","year":"1989","unstructured":"L. Bachmair. Proof normalization for resolution and paramodulation. In N. Dershowitz, editor, Rewriting Techniques and Appl., pages 15\u201328, Springer-Verlag, Berlin, 1989. (Lecture Notes in Comp. Science, Vol 355)."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"F. Bronsard and U. S. Reddy. An axiomatization of a functional logic language. In Algebraic and Logic Programming, pages 101\u2013116, Springer-Verlag, Oct 1990. (LNCS Vol. 463).","DOI":"10.1007\/3-540-53162-9_33"},{"issue":"3","key":"1_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"L. Fribourg. A strong restriction of the inductive completion procedure. In Intern. Conf. Aut., Lang. and Program., pages 105\u2013115, Rennes, France, July 1986. (Springer Lecture Notes in Computer Science, Vol. 226).","DOI":"10.1007\/3-540-16761-7_60"},{"key":"1_CR5","unstructured":"M.-C. Gaudel and S. Kaplan. How to build meaningful algebraic specification. ESPRIT Meteor Project Technical report, Orsay-France, 1986."},{"key":"1_CR6","first-page":"96","volume-title":"Symp. on Foundations of Computer Science","author":"G. Huet","year":"1980","unstructured":"G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. In Symp. on Foundations of Computer Science, pages 96\u2013107, IEEE, Lake Placid, NY, October 1980."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Jieh Hsiang and Micha\u00ebl Rusinowitch. A new method for establishing refutational completeness in theorem proving. In J. H. Siekmann, editor, Proceedings of the Eighth International Conference on Automated Deduction; pages 141\u2013152, Oxford, England, July 1986. Vol. 230 of Lecture Notes in Computer Science, Springer, Berlin.","DOI":"10.1007\/3-540-16780-3_86"},{"key":"1_CR8","first-page":"358","volume-title":"Symp. on Logic in Computer Science","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in equational theories without constructors. In Symp. on Logic in Computer Science, pages 358\u2013366, IEEE, Cambridge, MA., June 1986."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(87)80010-X","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan. Simplifying conditional term rewriting systems: Unification, termination and confluence. J. of Symbolic Computation, 4:295\u2013334, 1987.","journal-title":"J. of Symbolic Computation"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"D. Kapur, P. Narendran, and H. Zhang. Proof by induction using test sets. In Conf. on Automated Deduction, Oxford, U.K., 1986.","DOI":"10.1007\/3-540-16780-3_83"},{"key":"1_CR11","first-page":"144","volume-title":"Conditional Term Rewriting Systems","author":"E. Kounalis","year":"1987","unstructured":"E. Kounalis and M. Rusinowitch. On word problems in Horn theories. In S. Kaplan and J.-P. Jouannaud, editors, Conditional Term Rewriting Systems, pages 144\u2013160, Springer-Verlag, Berlin, 1987. (LNCS Vol 308)."},{"key":"1_CR12","first-page":"154","volume-title":"ACM Symp. on Princ. of Program. Languages","author":"D. R. Musser","year":"1980","unstructured":"D. R. Musser. On proving inductive properties of abstract data types. In ACM Symp. on Princ. of Program. Languages, pages 154\u2013162, ACM, Las Vegas, 1980."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Functional logic languages, Part I. In Graph Reduction, pages 401\u2013425, Springer-Verlag, 1987. (Lecture Notes in Computer Science, Vol 279).","DOI":"10.1007\/3-540-18420-1_68"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Transformational derivation of programs using the Focus system. In Symp. Practical Software Development Environments, pages 163\u2013172, ACM, December 1988.","DOI":"10.1145\/64135.65019"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Rewriting techniques for program synthesis. In N. Dershowitz, editor, Rewriting Techniques and Appl., pages 388\u2013403, Springer-Verlag, 1989. (LNCS Vol. 355).","DOI":"10.1007\/3-540-51081-8_121"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Term rewriting induction. In M. Stickel, editor, Conf. on Automated Deduction, pages 162\u2013177, Springer-Verlag, 1990. (Lecture Notes in Artificial Intelligence, Vol. 449).","DOI":"10.1007\/3-540-52885-7_86"},{"key":"1_CR17","volume-title":"D\u00e9monstration Automatique: Techniques de r\u00e9\u00e9criture","author":"M. Rusinowitch","year":"1989","unstructured":"Micha\u00ebl Rusinowitch. D\u00e9monstration Automatique: Techniques de r\u00e9\u00e9criture. InterEditions, Paris, France, 1989."},{"key":"1_CR18","unstructured":"Sivakumar. Conditional Rewriting. PhD thesis, UIUC, 1988."},{"key":"1_CR19","first-page":"1","volume-title":"Conf. on Automated Deduction","author":"H. Zhang","year":"1988","unstructured":"H. Zhang and D. Kapur. First-order theorem proving using conditional rewrite rules. In E. Lusk and R. Overbeek, editors, Conf. on Automated Deduction, pages 1\u201320, Springer-Verlag, Berlin, 1988."}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54317-1_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:34Z","timestamp":1605646414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54317-1_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543176","9783540475583"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-54317-1_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}