{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T16:09:36Z","timestamp":1746806976235,"version":"3.40.5"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3742,"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":[[2003,5]]},"DOI":"10.1016\/s1571-0661(04)80654-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"76-90","source":"Crossref","is-referenced-by-count":2,"title":["Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http:\/\/www.logic.at\/css\/ftp03.pdf for the proofs."],"prefix":"10.1016","volume":"86","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[]},{"given":"Gernot","family":"Salzer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB1","unstructured":"Comon H., M. Dauchet, R. Gilleron, D. Lugiez, S. Tison and M. Tommasi, \u201cTree Automata Techniques and Applications (TATA),\u201d http:\/\/www.grappa.univ-lille3.fr\/tata, 1997."},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB2","series-title":"Tree Automata and Languages","first-page":"327","article-title":"Structural complexity of classes of tree languages","author":"Dauchet","year":"1992"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1093\/logcom\/6.2.173","article-title":"Hyperresolution and automated model building","volume":"2","author":"Ferm\u00fcller","year":"1996","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/LICS.1991.151654","article-title":"Logic programs as types for logic programs","author":"Fr\u00fchwirth","year":"1991","journal-title":"Logic in Computer Science"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Gallagher, J. P. and G. Puebla, Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs, in: 4th International Symposium, PADL 2002, LNCS 2257 (2002), pp. 243\u2013261.","DOI":"10.1007\/3-540-45587-6_16"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2747","article-title":"Set constraints and automata","volume":"1","author":"Gilleron","year":"1999","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Goubault-Larrecq J., Higher-order positive set constraints, in: Proc. 16th Int. Workshop Computer Science Logic (CSL'2002), Edinburgh, Scotland, Sep. 2002, LNCS 2471 (2002), pp. 473\u2013489.","DOI":"10.1007\/3-540-45793-3_32"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB8","unstructured":"Goubault-Larrecq J. and K. N. Verma, Alternating two-way AC-tree automata, Research Report LSV-02-11, Lab. Specification and Verification, ENS de Cachan, Cachan, France (2002), 21 pages."},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Gouranton V., P. R\u00e9ty and H. Seidl, Synchronized tree languages revisited and new applications, in: Proceedings of 6th Conference on Foundations of Software Science and Computation Structures, Genova (Italy), LNCS 2030 (2001), pp. 214\u2013229.","DOI":"10.1007\/3-540-45315-6_14"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB10","series-title":"Automated Deduction in Classical and Non-Classical Logics","first-page":"62","article-title":"Decision procedures and model building, or how to improve logical information in automated deduction","author":"Leitsch","year":"2000"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.46298\/dmtcs.240","article-title":"E-unification by means of tree tuple synchronized grammars","volume":"1","author":"Limet","year":"1997","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"year":"1984","series-title":"\u201cFoundations of Logic Programming,\u201d","author":"Lloyd","key":"10.1016\/S1571-0661(04)80654-6_NEWBIB12"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB13","unstructured":"Matzinger R., \u201cComputational Representations of Models in First-Order Logic,\u201d Dissertation, Technische Universit\u00e4t Wien, Austria (2000)."},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB14","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming 5","first-page":"697","article-title":"Transformation of logic programs","author":"Pettorossi","year":"1998"},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB15","unstructured":"R\u00e9ty P., \u201cLangages synchronis\u00e9s d'arbres et applications,\u201d Habilitation thesis (in French), LIFO, Universit\u00e9 d'Orl\u00e9ans (2001)."},{"key":"10.1016\/S1571-0661(04)80654-6_NEWBIB16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.46298\/dmtcs.300","article-title":"A unified framework to compute over tree synchronized grammars and primal grammars","volume":"5","author":"Saubion","year":"2002","journal-title":"Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T11:42:41Z","timestamp":1682768561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1571066104806546"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80654-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}