{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T12:24:46Z","timestamp":1716294286171},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)00296-8","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"341-357","source":"Crossref","is-referenced-by-count":3,"title":["Knuth-Bendix Completion for Non-Symmetric Transitive Relations"],"prefix":"10.1016","volume":"59","author":[{"given":"Georg","family":"Struth","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB1","series-title":"Term rewriting and all that","author":"Baader","year":"1998"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB2","series-title":"Canonical Equational Proofs","author":"Bachmair","year":"1991"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB3","doi-asserted-by":"crossref","unstructured":"L. Bachmair and H. Ganzinger. Rewrite techniques for transitive relations. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 384\u2013393. IEEE Computer Society Press, 1994.","DOI":"10.1109\/LICS.1994.316051"},{"issue":"4","key":"10.1016\/S1571-0661(04)00296-8_NEWBIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(85)80019-5","article-title":"Termination orderings for associative-commutative rewriting systems","volume":"1","author":"Bachmair","year":"1985","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB5","doi-asserted-by":"crossref","unstructured":"L. Bachmair, C.R. Ramakrishnan, I.V. Ramakrishnan, and A. Tiwari. Normalization via rewrite closures. In P. Narendran and M. Rusinowitch, editors, Rewriting Techniques and Applications, 10th International Conference, RTA-99, volume 1631 of LNCS, pages 190\u2013204. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48685-2_15"},{"issue":"2","key":"10.1016\/S1571-0661(04)00296-8_NEWBIB6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(95)00061-5","article-title":"Buchberger's algorithm: The term rewriter's point of view","volume":"159","author":"B\u00fcndgen","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB7","doi-asserted-by":"crossref","unstructured":"H. Comon. Completion of rewrite systems with membership constraints. In Int. Coll. on Automata, Languages and Programming, ICALP'92, volume 623 of LNCS. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_91"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB8","doi-asserted-by":"crossref","unstructured":"C. Delor and L. Puel. Extension of the associative path ordering to a chain of associative-commutative symbols. In C. Kirchner, editor, Rewriting Techniques and Applications, volume 690 of LNCS, pages 389\u2013404. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56868-9_29"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB9","series-title":"Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6","first-page":"244","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB10","unstructured":"D. Kapur. Shostak's congrucence closure as completion. In H. Comon, editor, Rewrite Techniques and Applications, 8th International Conference, RTA-97, volume 1232 of LNCS, pages 23\u201337. Springer-Verlag, 1997."},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1006\/jsco.1996.0053","article-title":"Bi-rewrite systems","volume":"22","author":"Levy","year":"1996","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB12","doi-asserted-by":"crossref","unstructured":"J. Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02R, SRI International, 1990.","DOI":"10.1007\/BFb0039072"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB13","unstructured":"M. Schmidt-Schauss. A decision algorithm for stratified context unification. Technical Report Frank-report-12, FB Informatik, J.W. Goethe-Universit\u00e4t Frankfurt am Main, 1999."},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB14","doi-asserted-by":"crossref","unstructured":"K. Stokkermans. A Categorial Framework and Calculus for Critical-Pair Completion. PhD thesis, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, 1995.","DOI":"10.1007\/978-3-7091-6604-8_6"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB15","unstructured":"G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, 1996."},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB16","unstructured":"G. Struth. Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut f\u00fcr Informatik, Universit\u00e4t des Saarlandes, 1998."},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB17","doi-asserted-by":"crossref","unstructured":"G. Struth. An algebra of resolution. In L. Bachmair, editor, Rewriting Techniques and Applications, 11th International Conference, volume 1833 of LNCS, pages 214\u2013228. Springer-Verlag, 2000.","DOI":"10.1007\/10721975_15"},{"key":"10.1016\/S1571-0661(04)00296-8_NEWBIB18","doi-asserted-by":"crossref","unstructured":"G. Struth. Deriving focused calculi for transitive relations. In A. Middeldorp, editor, Rewriting Techniques and Applications, 12th International Conference, volume 2051 of LNCS, pages 291\u2013305. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45127-7_22"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T12:28:09Z","timestamp":1585571289000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104002968"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00296-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}