{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:03Z","timestamp":1725557583141},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_11","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"169-178","source":"Crossref","is-referenced-by-count":3,"title":["ACID-Unification Is NEXPTIME-Decidable"],"prefix":"10.1007","author":[{"given":"Siva","family":"Anantharaman","sequence":"first","affiliation":[]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aiken, A., Wimmers, E.: Solving Systems of Set Constraints. In: Proc. of the 7th IEEE Symposium on Logic in Computer Science (LICS 1992), pp. 329\u2013340 (1992)","DOI":"10.1109\/LICS.1992.185545"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0049320","volume-title":"Computer Science Logic","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., Kozen, D., Vardi, M., Wimmers, E.: The Complexity of Set Constraints. In: Meinke, K., B\u00f6rger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol.\u00a0832, pp. 1\u201318. Springer, Heidelberg (1994)"},{"key":"11_CR3","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: Unification over ACUI plus Distributivity\/Homomorphisms. To appear in Proc. of CADE-19 (2003), cf. also the long version: ftp:\/\/ftp-lifo.univ-orleans.fr\/pub\/Users\/siva\/RR2002-11.ps"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: AC(U)ID-Unification is NEXPTIME-Decidable. Research Report RR-2003-02, LIFO, Universit\u00e9 d\u2019Orleans (Fr.), ftp:\/\/ftp-lifo.univ-orleans.fr\/pub\/Users\/siva\/RR2003-02.ps","DOI":"10.1007\/978-3-540-45138-9_11"},{"key":"11_CR5","volume-title":"Handbook of Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification Theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning. Elsevier Science Publishers, Amsterdam (2001)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H., Waldmann, U.: Set Constraints are the Monadic Class. In: Proceedings of the 8th IEEE Symp. on Logic in Computer Science (LICS 1993), pp. 75\u201383 (1993)","DOI":"10.1109\/LICS.1993.287598"},{"key":"11_CR7","unstructured":"Charatonik, W.: Automata on DAG representations of finite trees. Technical Report MPI-I-99-2-001, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Charatonik, W., Pacholski, L.: Set constraints with projections are in NEXPTIME. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 642\u2013653 (1994)","DOI":"10.1109\/SFCS.1994.365727"},{"key":"#cr-split#-11_CR9.1","doi-asserted-by":"crossref","unstructured":"Charatonik, W., Podelski, A.: Set Constraints with Intersection. In: Proc. of the 12th IEEE Symposium on Logic in Computer Science (LICS 1997), Warsaw, pp. 362???372 (1997);","DOI":"10.1109\/LICS.1997.614962"},{"key":"#cr-split#-11_CR9.2","unstructured":"To appear in: Information and Computation"},{"key":"11_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/3-540-56503-5_50","volume-title":"STACS 93","author":"R. Gilleron","year":"1993","unstructured":"Gilleron, R., Tison, S., Tommasi, M.: Solving Systems of Set Constraints using Tree Automata. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 505\u2013514. Springer, Heidelberg (1993)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2747","volume":"149","author":"R. Gilleron","year":"1999","unstructured":"Gilleron, R., Tison, S., Tommasi, M.: Set Constraints and Tree Automata. Information and Computation\u00a0149, 1\u201341 (1999)","journal-title":"Information and Computation"},{"issue":"1-2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1009826603139","volume":"5","author":"J.-M. Talbot","year":"2000","unstructured":"Talbot, J.-M., Devienne, P., Tison, S.: Generalized Definite Set Constraints. CONSTRAINTS: an International Journal\u00a05(1-2), 161\u2013202 (2000)","journal-title":"CONSTRAINTS: an International Journal"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:07Z","timestamp":1559195647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}