{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:42Z","timestamp":1725663342852},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540506676"},{"type":"electronic","value":"9783540460633"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50667-5_61","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:30:43Z","timestamp":1330201843000},"page":"93-107","source":"Crossref","is-referenced-by-count":1,"title":["A completion procedure for hierarchical conditional rewriting systems"],"prefix":"10.1007","author":[{"given":"Wadoud","family":"Bousdira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"unstructured":"L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. Sym. Logic in Computer Science, pages 346\u2013357, Boston (Massachusetts USA), 1986.","key":"9_CR1"},{"doi-asserted-by":"crossref","unstructured":"W. Bousdira. A completion procedure for hierarchical conditional equations. 88-R-021, Centre de Recherche en Informatique de Nancy, 1988.","key":"9_CR2","DOI":"10.1007\/3-540-50667-5_61"},{"unstructured":"W. Bousdira and J.L. R\u00e9my. Compl\u00e9tion des syst\u00e8mes de r\u00e9\u00e9criture conditionnelle. In Actes des journ\u00e9es GROSPLAN, editor, revue BIGRE+GLOBULE, Aix-en-Provence, 1987.","key":"9_CR3"},{"key":"9_CR4","first-page":"193","volume-title":"Lecture Notes in Computer Science","author":"W. Bousdira","year":"1988","unstructured":"W. Bousdira and J.L. R\u00e9my. Hierarchical contextual rewriting with several levels. In R. Cori and M. Wirsing, editors, Lecture Notes in Computer Science, pages 193\u2013206, 5th Synposium on Theoretical Aspects of Computer Science, Springer-Verlag, Bordeaux France, 1988."},{"unstructured":"H. Ganzinger. A completion procedure for conditional equations specifications. In to appear in Journal of Symbolic Computation, 1987.","key":"9_CR5"},{"key":"9_CR6","first-page":"286","volume-title":"Lecture Notes in Computer Science No 247","author":"H. Ganzinger","year":"1987","unstructured":"H. Ganzinger. Ground term confluence in parametric conditional equational specifications. In F.J. Brandenburg, G. Vidal, and M. Wirsing, editors, Lecture Notes in Computer Science No 247, pages 286\u2013298, 4th annual Symposium on Theoretial Aspects of Computer Science, Springer-Verlag, Passau RFA, 1987."},{"unstructured":"J.A. Goguen and J. Meseguer. Completeness of many-sorted equational logic. Technical Report CSLI-84-15, Center for the Study of Language and Information Stanford University, 1984.","key":"9_CR7"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the Associations for Computing Machinery, 27(4):797\u2013821, 1980. Preliminary version of the 18th Symposium on Foundations of Computer Science.","journal-title":"Journal of the Associations for Computing Machinery"},{"unstructured":"J.P. Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In M. Wirsing, editor, Elsevier Science Publishers, 3rd IFIP Conf. on Formal description of Programming Concepts, Ebberup Denmark, 1986.","key":"9_CR9"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"3","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan. Conditional rewrite rules. Theoretical Computer Science. 3:175\u2013193, 1984.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"S. Kaplan. Simplifying conditional term rewriting systems: unification, termination and confluence. to appear in Journal of Symbolic Computation, 1987.","key":"9_CR11","DOI":"10.1016\/S0747-7171(87)80010-X"},{"key":"9_CR12","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra. pages 263\u2013297, Pergamon Press, Elmsford N.Y, 1970."},{"unstructured":"S. Kaplan and J.L. R\u00e9my. Completion algorithms for conditional rewriting systems. In H. Ait-Kaci and M. Nivat, editors, Proceedings of the MCC-INRIA Colloquium on the Resolution of Equations in Algebraic Structures, MCC and INRIA, Austin Texas, 1987.","key":"9_CR13"},{"unstructured":"M. Navarro. T\u00e9cnicas de Reescritura para especificaciones condicionales. Th\u00e8se Doctorale, Barcelone, 1987.","key":"9_CR14"},{"doi-asserted-by":"crossref","unstructured":"M. Navarro and F. Orejas. On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems. In Eurosam Conference, Oxford, 1984.","key":"9_CR15","DOI":"10.1007\/BFb0032832"},{"key":"9_CR16","first-page":"202","volume-title":"Lecture Notes in Computer Science","author":"M. Navarro","year":"1984","unstructured":"M. Navarro and F. Orejas. Parameterized horn clause specifications: proof theory and correctness. In Lecture Notes in Computer Science, pages 202\u2013216, TAPSOFT'87, Springer-Verlag 249, Pisa Italy, 1984."},{"unstructured":"J.L. R\u00e9my and H. Zhang. Reveur4: a system for validating conditional algebraic specifications of abstract data types. In ECAI, 6th ECAI Conference, Pisa Italy, 1984.","key":"9_CR17"},{"unstructured":"H. Zhang. REVEUR4: Etude et mise en \u0153uvre de la r\u00e9\u00e9criture conditionnelle. Universit\u00e9 de Nancy 1, 1984.","key":"9_CR18"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50667-5_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T10:08:27Z","timestamp":1561370907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}