{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:21Z","timestamp":1725456741875},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540508406"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028998","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:28:19Z","timestamp":1133414899000},"page":"348-359","source":"Crossref","is-referenced-by-count":3,"title":["It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair"],"prefix":"10.1007","author":[{"given":"Paliath","family":"Narendran","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Stillman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"The Computer Modelling of Human Reasoning","author":"A. Bundy","year":"1983","unstructured":"Bundy, A., The Computer Modelling of Human Reasoning, Academic Press, New York, 1983."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-15976-2_9","volume-title":"Rewriting Techniques and Applications","author":"N. Dershowitz","year":"1985","unstructured":"Dershowitz, N., \u201cTermination,\u201d in Rewriting Techniques and Applications, Jean-Pierre Jouannaud, ed., Springer Verlag, Berlin, 1985, pp. 180\u2013224."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Gorn, S., \u201cExplicit Definitions and Linguistic Dominoes,\u201d in Systems and Computer Science (J. Hart and S. Takasu, eds.), U. of Toronto Press, 1967, pp. 77\u2013115.","DOI":"10.3138\/9781487592769-008"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00264362","volume":"24","author":"S. Heilbrunner","year":"1987","unstructured":"Heilbrunner, S., and H\u00f6lldobler, S., \u201cThe Undecidability of the Unification and Matching Problem for Canonical Theories,\u201d Acta Informatica, 24, pp. 157\u2013171, 1987.","journal-title":"Acta Informatica"},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-16761-7_64","volume-title":"Proc. 13th EATCS Intl. Colloq. on Automata, Languages, and Programming","author":"M. Hermann","year":"1986","unstructured":"Hermann, M., and Privara, I., \u201cOn nontermination of the Knuth-Bendix algorithm,\u201d in Proc. 13th EATCS Intl. Colloq. on Automata, Languages, and Programming, L. Kott, ed., Springer Verlag, Berlin, 1986, pp. 146\u2013156."},{"key":"30_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E., and Ullman, J. D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, Reading, MA, 1979."},{"key":"30_CR7","series-title":"Rapport Laboria","volume-title":"On the Uniform Halting Problem for Term Rewriting Systems","author":"G. Huet","year":"1978","unstructured":"Huet, G., and Lankford, D.S., \u201cOn the Uniform Halting Problem for Term Rewriting Systems,\u201d Rapport Laboria 283, INRIA, Paris, 1978."},{"key":"30_CR8","volume-title":"Formal Languages: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"Huet, G., and Oppen, D., \u201cEquations and rewrite rules: a survey,\u201d in Formal Languages: Perspectives and Open Problems (R. Book, ed.), Academic Press, New York, 1980."},{"key":"30_CR9","volume-title":"Proc. Conference on Foundations of Software Technology and Theoretical Computer Science (FST & TCS)","author":"D. Kapur","year":"1988","unstructured":"Kapur, D., Musser, D., Narendran, P., and Stillman, J., \u201cSemi-unification,\u201d in Proc. Conference on Foundations of Software Technology and Theoretical Computer Science (FST & TCS), Springer Verlag, Berlin, 1988."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-17220-3_16","volume-title":"Rewriting Techniques and Applications","author":"H. Kirchner","year":"1987","unstructured":"Kirchner, H., \u201cSchematization of infinite sets of rewrite rules. Application to the divergence of completion processes,\u201d in Rewriting Techniques and Applications, Pierre Lescanne, ed., Springer Verlag, Berlin, 1987, pp. 180\u2013191."},{"key":"30_CR11","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"Knuth, D., and Bendix, P., \u201cSimple word problems in universal algebras,\u201d in Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press, Oxford, 1970, pp. 263\u2013297."},{"key":"30_CR12","unstructured":"Narendran, P., and Stillman, J., \u201cOn the Complexity of Homeomorphic Embedding,\u201d presented at the Fifth International Conference on Algebra, Algebraic Algorithms, and Error-Correcting Codes, (AAECC-5), Menorca, Spain, June 1987 (proceedings to appear in Lecture Notes in Computer Science)."},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-16780-3_81","volume-title":"Proc. 8th International Conference on Automated Deduction","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A., \u201cA simple non-termination test for the Knuth-Bendix method,\u201d in Proc. 8th International Conference on Automated Deduction, J\u00f6rg Siekmann, ed., Springer-Verlag, Berlin, 1986, pp. 79\u201388."},{"key":"30_CR14","unstructured":"Schmidt-Schau\u00df, M., \u201cUnification in permutative equational theories is undecidable,\u201d Technical Report SR-87-03, Universit\u00e4t Kaiserslautern."}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0028998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:11Z","timestamp":1586592911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540508406"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0028998","relation":{},"subject":[]}}