{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:47Z","timestamp":1750306607841,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Danish Council for Independent Research Sapere Aude grant Complexity through Logic and Algebra"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2015,3,21]]},"abstract":"<jats:p>A full and finitely generated Church-Rosser term rewriting system is presented that has no computable one-step, normalizing strategy; the system is both left- and right-linear. The result provides a negative answer to a question posed by Kennaway in 1989: Number 10 on the List of Open Problems in Rewriting.<\/jats:p>","DOI":"10.1145\/2699917","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T13:24:05Z","timestamp":1424265845000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy"],"prefix":"10.1145","volume":"16","author":[{"given":"Jakob Grue","family":"Simonsen","sequence":"first","affiliation":[{"name":"University of Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00041-2"},{"key":"e_1_2_1_2_1","first-page":"1134","article-title":"Persistency of confluence","volume":"3","author":"Aoto Takahito","year":"1997","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90022-8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/111853.111894"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(02)93150-0"},{"key":"e_1_2_1_6_1","unstructured":"Gerard Huet and Dallas S. Lankford. 1978. On the Uniform Halting Problem for Term Rewriting Systems. Rapport Laboria 283. IRIA.  Gerard Huet and Dallas S. Lankford. 1978. On the Uniform Halting Problem for Term Rewriting Systems. Rapport Laboria 283. IRIA."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(89)90024-9"},{"key":"e_1_2_1_8_1","unstructured":"Jan Willem Klop. 1980. Combinatory Reduction Systems. Ph.D. dissertation. State University of Utrecht Utrecht The Netherlands.  Jan Willem Klop. 1980. Combinatory Reduction Systems. Ph.D. dissertation. State University of Utrecht Utrecht The Netherlands."},{"key":"e_1_2_1_9_1","volume-title":"Lecture Notes in Computer Science","volume":"4600","author":"Klop Jan Willem","year":"2007"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1946-08555-9"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19580040705"},{"volume":"55","volume-title":"Cambridge Tracts in Theoretical Computer Science","year":"2003","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1003"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2699917","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2699917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:59Z","timestamp":1750227419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2699917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3,21]]}},"alternative-id":["10.1145\/2699917"],"URL":"https:\/\/doi.org\/10.1145\/2699917","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2015,2,17]]},"assertion":[{"value":"2014-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}