{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:19:16Z","timestamp":1760170756425,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:16:21Z","timestamp":1330254981000},"page":"505-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Solving systems of set constraints using tree automata"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Gilleron","sequence":"first","affiliation":[]},{"given":"Sophie","family":"Tison","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Tommasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and E.L. Wimmers. Solving System of Set Constraints. In 7th Symposium on LICS, pages 329\u2013340, 1992.","DOI":"10.1109\/LICS.1992.185545"},{"key":"50_CR2","unstructured":"L. Bachmair, H. Ganzinger, and U. Waldmann. Solving Set Constraints by Ordered Resolution with Simplification. Draft manuscript, September 92."},{"key":"50_CR3","unstructured":"T. Fr\u00fcwirth, E.Shapiro, M.Y. Vardi, and E.Yardeni. Logic Programs as Types for Logic Programs. In 6th Symposium on LICS, 1991."},{"key":"50_CR4","unstructured":"F. Gecseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984."},{"key":"50_CR5","volume-title":"Technical Report IT-92-235","author":"R. Gilleron","year":"1992","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving System of Set Constraints using Tree Automata. Technical Report IT-92-235, Laboratoire d'Informatique Fondamentale de Lille, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, July 1992."},{"key":"50_CR6","unstructured":"N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints. In 5th Symposium on LICS, 1990."},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A Finite Presentation Theorem for Approximating Logic Programs. IBM technical report RC 16089 (#71415), IBM, August 1990.","DOI":"10.1145\/96709.96729"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"N.D. Jones and S.S. Muchnick. Flow Analysis and Optimization of LISP-like Structures. In Proceedings 6 th ACM Symposium on Principles of Programming Languages, pages 244\u2013246, 1979.","DOI":"10.1145\/567752.567776"},{"key":"50_CR9","unstructured":"P. Mishra. Towards a Theory of Types in PROLOG. In Proceedings 1st IEEE Symposium on Logic Programming, pages 456\u2013461, Atlantic City, 1984. 10."},{"key":"50_CR10","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"M.O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Trans. Amer. Math. Soc., 141:1\u201335, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"50_CR11","first-page":"456","volume":"68","author":"J. C. Reynolds","year":"1969","unstructured":"J.C. Reynolds. Automatic Computation of Data Set Definition. Information Processing, 68:456\u2013461, 1969.","journal-title":"Information Processing"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Handbook of Theoretical Computer Science, volume B, chapter Automata on Infinite Objects, pages 134\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"T. E. Uribe. Sorted Unification Using Set Constraints. In D. Kapur, editor, Lecture Notes in Computer Science, New York, 1992. 11th International Conference on Automated Deduction.","DOI":"10.1007\/3-540-55602-8_163"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:49:25Z","timestamp":1742593765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}