{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:11:16Z","timestamp":1672251076796},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(01)00248-1","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T19:22:41Z","timestamp":1043954561000},"page":"103-149","source":"Crossref","is-referenced-by-count":10,"title":["Combining word problems through rewriting in categories with products"],"prefix":"10.1016","volume":"294","author":[{"given":"Camillo","family":"Fiorentini","sequence":"first","affiliation":[]},{"given":"Silvio","family":"Ghilardi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00248-1_BIB1","series-title":"Arrow Logic and Multi-modal logic","first-page":"63","article-title":"Causes and remedies for undecidability in arrow logics and in multi-modal logics","author":"Andr\u00e9ka","year":"1996"},{"key":"10.1016\/S0304-3975(01)00248-1_BIB2","series-title":"Term Rewriting and all that","author":"Baader","year":"1998"},{"key":"10.1016\/S0304-3975(01)00248-1_BIB3","series-title":"Rewriting Techniques and Applications (Trento, 1999)","first-page":"175","article-title":"Deciding the word problem in the union of equational theories sharing constructors","author":"Baader","year":"1999"},{"key":"10.1016\/S0304-3975(01)00248-1_BIB4","unstructured":"F. Baader, C. Tinelli, Deciding the word problem in the union of equational theories, Inform. and Computation, Special issue of selected papers from RTA\u201999, in preparation."},{"key":"10.1016\/S0304-3975(01)00248-1_BIB5","first-page":"48","article-title":"Combination techniques for nondisjoint equational theories","volume":"Vol. 814","author":"Domenjoud","year":"1996"},{"key":"10.1016\/S0304-3975(01)00248-1_BIB6","unstructured":"C. Fiorentini, S. Ghilardi, Path Rewriting and combined word problems, Technical Report 250-00, Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Milano, 2000, Available at http:\/\/gongolo.usr.dsi.unimi.it\/\u223cfiorenti\/download\/tr_250-00.ps.gz."},{"key":"10.1016\/S0304-3975(01)00248-1_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-4049(72)90001-1","article-title":"Categories of continuous functors. I","volume":"2","author":"Freyd","year":"1972","journal-title":"J. Pure Appl. Algebra"},{"issue":"3","key":"10.1016\/S0304-3975(01)00248-1_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0168-0072(93)E0084-2","article-title":"An algebraic theory of normal forms","volume":"71","author":"Ghilardi","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.1016\/S0304-3975(01)00248-1_BIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/malq.19900360303","article-title":"Modal logics with n-ary connectives","volume":"36","author":"Ghilardi","year":"1990","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0304-3975(01)00248-1_BIB10","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","article-title":"Functorial semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963","journal-title":"Proc. Nat. Acad. Sci. USA."},{"key":"10.1016\/S0304-3975(01)00248-1_BIB11","doi-asserted-by":"crossref","unstructured":"C. L\u00fcth, Categorical term rewriting: monads and modularity, Ph.D. Thesis, University of Edinburgh, 1997.","DOI":"10.1007\/BFb0026982"},{"issue":"6","key":"10.1016\/S0304-3975(01)00248-1_BIB12","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/S0747-7171(08)80145-9","article-title":"Combining matching algorithms","volume":"12","author":"Nipkow","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(01)00248-1_BIB13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.4064\/cm-30-1-15-25","article-title":"The join of equational theories","volume":"30","author":"Pigozzi","year":"1974","journal-title":"Colloq. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002481?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002481?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T13:50:44Z","timestamp":1553953844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397501002481"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00248-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}