{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:32Z","timestamp":1725663512362},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:05Z","timestamp":1330254485000},"page":"328-342","source":"Crossref","is-referenced-by-count":2,"title":["A categorical formulation for critical-pair\/completion procedures"],"prefix":"10.1007","author":[{"given":"Karcl","family":"Stokkermans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(75)90208-9","volume":"28","author":"David B. B. Benson","year":"1975","unstructured":"David B. Benson. The basic algebraic structures in the categories of derivations. Information and Control, 28:1\u201329, 1975.","journal-title":"Information and Control"},{"key":"25_CR2","first-page":"11","volume":"Supplement 4","author":"B. Buchberger","year":"1982","unstructured":"Bruno Buchberger and Rudiger Loos. Algebraic simplication. Computing, Supplement 4:11\u201343, 1982. Appeared as report CAMP 82-12.0, RISC, Linz, Austria.","journal-title":"Computing"},{"key":"25_CR3","unstructured":"Bruno Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Universit\u00e4t Innsbruck, 1965."},{"key":"25_CR4","unstructured":"Bruno Buchberger. A critical-pair\/completion algorithm in reduction rings. CAMP-Technical Report 83-21.0, Universit\u00e4t. Linz, 1983."},{"key":"25_CR5","first-page":"184","volume-title":"Recent Trends in Multidimensional Systems Theory","author":"B. Buchberger","year":"1983","unstructured":"Bruno Buchberger. Gr\u00f6bner bases: An algorithmic method in polynomial ideal theory. In N.K. Bose, editor, Recent Trends in Multidimensional Systems Theory, chapter 6, pages 184\u2013232. Reidel, Dordrecht, The Netherlands, 1983."},{"key":"25_CR6","first-page":"1","volume-title":"Proc. First Int. Conf. RTA, LNCS 202","author":"B. Buchberger","year":"1985","unstructured":"Bruno Buchberger. Basic features and development of the critical-pair\/completion procedure. In Jean-Pierre Jouannaud, editor, Proc. First Int. Conf. RTA, LNCS 202, pages 1\u201345, Dijon, 1985. Springer Verlag."},{"key":"25_CR7","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewriting systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 243\u2013320. Elsevier Publishers, Amsterdam, 1990."},{"key":"25_CR8","unstructured":"G\u00e9rard Huet and Jean-Jacques L\u00e9vy. Call by need computations in non-ambiguous linear term rewriting systems. Rapport Laboria 359, IRIA, August 1979."},{"issue":"1","key":"25_CR9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G. Huet","year":"1981","unstructured":"G\u00e9rard Huet. A complete proof of correctness of the Knuth-Bendix completion algorithm. Journal of Computer and System Sciences, 23(1):11\u201321, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR10","unstructured":"G\u00e9rard Huet. Formal structures for computation and deduction. Working material for lectures at the International Summer School on Logic of Programming and Calculi of Discrete Design in Marktoberdorf, Germany, July 29\u2013August 10 1986."},{"key":"25_CR11","unstructured":"Michael Johnson. Pasting Diagrams in n-Calegories with Applications to Coherence Theorems and Categories of Paths. PhD thesis, University of Sydney, 1987."},{"key":"25_CR12","unstructured":"Michael Johnson. Linear term rewriting systems are higher dimensional string rewriting systems. In C.M.I. Rattray and R.G. Clark, editors, The Unified Computation Laboratory, pages 3\u201312. Oxford University Press, 1991."},{"key":"25_CR13","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"Donald E. E. Knuth","year":"1967","unstructured":"Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013298, Oxford, 1967. Pergamon Press. Appeared 1970."},{"key":"25_CR14","volume-title":"PhD thesis","author":"J. W. Klop","year":"1980","unstructured":"Jan Willem Klop. Combinatory Reduction Systems. PhD thesis, Mathematisch Centrum, Amsterdam, 1980."},{"key":"25_CR15","volume-title":"Technical Report CS-R9073","author":"J. W. Klop","year":"1990","unstructured":"Jan Willem Klop. Term rewriting systems. Technical Report CS-R9073, Centrum voor Wiskunde en Informatica, Amsterdam, 1990."},{"key":"25_CR16","unstructured":"Joachim Lambek. From \u03bb-calculus to cartesian closed categories. In James Paul Seldin and James Roger Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 375\u2013402. Academic Press, 1980."},{"key":"25_CR17","unstructured":"Jean-Jacques L\u00e9vy. R\u00e9ductions correctes et optimales dans le \u03bb-calcul. Th\u00e8se d'Etat, Universit\u00e9 de Paris VII, 1978."},{"key":"25_CR18","unstructured":"Joachim Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic, volume 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986."},{"key":"25_CR19","unstructured":"Saunders MacLane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer Verlag, 1971."},{"key":"25_CR20","volume-title":"Technical Report CS-R9160","author":"A. Middeldorp","year":"1991","unstructured":"Aart Middeldorp and Mirjana Star\u010devi\u0107. A rewrite approach to polynomial ideal theory. Technical Report CS-R9160, Centrum voor Wiskunde en Informatica, Amsterdam, 1991."},{"key":"25_CR21","volume-title":"Artificial Intelligence","author":"E. Rich","year":"1983","unstructured":"Elaine Rich. Artificial Intelligence. McGraw-Hill, London, 1983."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"John Alan Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23\u201341, 1965.","journal-title":"Journal of the ACM"},{"key":"25_CR23","series-title":"Literature Survey and Work Plan for Ph.D Thesis","volume-title":"Technical Report 91-58.0","author":"K. Stokkermans","year":"1991","unstructured":"Karel Stokkermans. A categorical approach to critical-pair\/completion procedures. Technical Report 91-58.0, RISC-Linz, J. Kepler University, Linz, Austria, Europe, December 1991. Literature Survey and Work Plan for Ph.D Thesis."},{"key":"25_CR24","volume-title":"Functional Programming Using Standard ML","author":"\u00c5. Wikstr\u00f6m","year":"1987","unstructured":"\u00c5ke Wikstr\u00f6m. Functional Programming Using Standard ML. Prentice Hall International, Hemel Hempstead, United Kingdom, 1987."}],"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-56393-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:22Z","timestamp":1619571022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}