{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:36Z","timestamp":1761611136849},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":3893,"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":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80514-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"52-69","source":"Crossref","is-referenced-by-count":3,"title":["Pattern Unification with Sequence Variables and Flexible Arity Symbols"],"prefix":"10.1016","volume":"66","author":[{"given":"Temur","family":"Kutsia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"F. Ajili and E. Contejean. Complete solving of linear Diophantine equations and inequations without adding variables. In U. Montanari and F. Rossi, editors, Proceedings of the First International Conference on Principles and Practice of Constraint Programming, volume 1949 of Lecture Notes in Computer Science, pages 1\u201317, Cassis, France, 1995. Springer Verlag.","DOI":"10.1007\/3-540-60299-2_1"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB2","unstructured":"B. Buchberger. Mathematica as a rewrite language. In T. Ida, A. Ohori, and M. Takeichi, editors, Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming), pages 1\u201313, Shonan Village Center, Japan, 1\u20134 November 1996. World Scientific."},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB3","author":"Buchberger","year":"2001","journal-title":"Personal communication"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB4","unstructured":"B. Buchberger, C. Dupre, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, and W. Windsteiger. The Theorema project: A progress report. In M. Kerber and M. Kohlhase, editors, Symbolic Computation and Automated Reasoning. Proceedings of Calculemus'2000, pages 98\u2013113, St. Andrews, UK, 6\u20137 August 2000."},{"issue":"7","key":"10.1016\/S1571-0661(04)80514-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","article-title":"An introduction to Prolog III","volume":"33","author":"Colmerauer","year":"1990","journal-title":"CACM"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB6","unstructured":"M. R. Genesereth. Epilog for Lisp 2.0 Manual. Epistemics Inc., Palo Alto, US, 1995."},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB7","unstructured":"M. R. Genesereth and R. E. Fikes. Knowledge Interchange Format, Version 3.0 Reference Manual. Technical Report Logic-92-1, Computer Science Department, Stanford University, Stanford, US, June 1992."},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"S. Ginsburg and X. S. Wang. Pattern matching by Rs-operations: Toward a unified approach to querying sequenced data. In Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 293\u2013300, San Diego, US, 2\u20134 June 1992.","DOI":"10.1145\/137097.137895"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB9","doi-asserted-by":"crossref","unstructured":"G. Grahne and E. Waller. How to make SQL stand for string query language. In R. Connor and A. Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming. Proceedings of the 7th International Workshop on Database Programming Languages, DBPL'99, volume 1949 of Lecture Notes in Computer Science, pages 61\u201379, Kinloch Rannoch, UK, 1\u20133 September 2000. Springer Verlag.","DOI":"10.1007\/3-540-44543-9_5"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB10","unstructured":"M. Hamana. Term rewriting with sequences. In Proceedings of the First International Theorema Workshop, Hagenberg, Austria, 9\u201310 June 1997."},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB11","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1967"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB12","doi-asserted-by":"crossref","unstructured":"T. Kutsia. Solving and proving in equational theories with sequence variables and flexible arity symbols. PhD Thesis. Available from http:\/\/www.risc.uni-linz.ac.at\/people\/tkutsia\/pub\/Thesis.pdf, 2002.","DOI":"10.1016\/S1571-0661(04)80514-0"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB13","doi-asserted-by":"crossref","unstructured":"T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 and Calculemus'2002 Conferences, volume 2385 of Lecture Notes in Artificial Intelligence, pages 290\u2013304, Marseille, France, 1\u20135 July 2002. Springer Verlag.","DOI":"10.1007\/3-540-45470-5_26"},{"issue":"2","key":"10.1016\/S1571-0661(04)80514-0_NEWBIB14","doi-asserted-by":"crossref","DOI":"10.1070\/SM1977v032n02ABEH002376","article-title":"The problem of solvability of equations on a free semigroup","volume":"32","author":"Makanin","year":"1977","journal-title":"Math. USSR Sbornik"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB15","doi-asserted-by":"crossref","unstructured":"G. Mecca and A. J. Bonner. Sequences, Datalog and transducers. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 23\u201335, San Jose, US, 22\u201325 May 1995.","DOI":"10.1145\/212433.212440"},{"issue":"2","key":"10.1016\/S1571-0661(04)80514-0_NEWBIB16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00881904","article-title":"Word unification and transformation of generalized equations","volume":"11","author":"Schulz","year":"1993","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB17","unstructured":"M. Widera and C. Beierle. A term rewriting scheme for function symbols with variable arity. Technical Report 280, Prakt. Informatik VIII, FernUniversit\u00e4t Hagen, Germany, 2001."},{"key":"10.1016\/S1571-0661(04)80514-0_NEWBIB18","series-title":"The Mathematica Book","author":"Wolfram","year":"1999"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:54:58Z","timestamp":1549191298000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1571066104805140"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80514-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}