{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:29:32Z","timestamp":1736573372443,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055809","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"589-596","source":"Crossref","is-referenced-by-count":1,"title":["Tarskian set constraints are in NEXPTIME"],"prefix":"10.1007","author":[{"given":"Pawel","family":"Mielniczuk","sequence":"first","affiliation":[]},{"given":"Leszek","family":"Pacholski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, M. Vardi, and E. L. Wimmers. The complexity of set constraints. In Computer Science Logic'93, LNCS 832, pages 1\u201317. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0049320"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, and E. L. Wimmers. Decidability of systems of set constraints with negative constraints. Technical Report 93-1362, Computer Science Department, Cornell University, June 1993.","DOI":"10.7146\/brics.v1i32.21611"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279\u2013290, January 1991.","DOI":"10.1145\/99583.99621"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. L. Wimmers. Solving systems of set constraints (extended abstract). In Seventh Annual IEEE Symposium on Logic in Computer Science, pages 329\u2013340, 1992.","DOI":"10.1109\/LICS.1992.185545"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Eight Annual IEEE Symposium on Logic in Computer Science, pages 75\u201383, 1993.","DOI":"10.1109\/LICS.1993.287598"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Set constraints with projections are in nexptime. In 35th Annual IEEE Symposium on Foundations of Computer Science, pages 642\u2013653, November 1994.","DOI":"10.1109\/SFCS.1994.365727"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In 10th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 665, pages 505\u2013514. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56503-5_50"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proceedings of the 34th Symp. on Foundations of Computer Science, pages 372\u2013380, 1993. A full version Technical report IT 247, Laboratoire d'Informatique Fondamentale de Lille.","DOI":"10.1109\/SFCS.1993.366850"},{"key":"56_CR9","unstructured":"D. Givan, R. McAllester. New results on local inference relations. In M. K. Press, editor, Principles of Knowledge representation and Reasoning: Proceedings of the Third International Conference, pages 403\u2013412, 1992."},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A decision procedure for a class of set constraints (extended abstract). In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 42\u201351, 1990.","DOI":"10.1109\/LICS.1990.113732"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197\u2013209, January 1990.","DOI":"10.1145\/96709.96729"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"N. D. Jones and S. S. Muchnick. Flow analysis and optimization of lisp-like structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244\u2013256, January 1979.","DOI":"10.1145\/567752.567776"},{"key":"56_CR13","first-page":"346","volume":"40","author":"D. A. McAllester","year":"1993","unstructured":"D. A. McAllester and R. Givan. Taxonomic syntax for first order inference. Journal of ACM, 40:346\u2013283, 1993.","journal-title":"Journal of ACM"},{"key":"56_CR14","first-page":"138","volume-title":"Tarskian set constraints","author":"D. A. McAllester","year":"1996","unstructured":"D. A. McAllester, R. Givan, C. Witty, and D. Kozen. Tarskian set constraints. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 138\u2013147, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press."},{"key":"56_CR15","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. Reddy. Declaration-free type checking. In Twelfth Annual ACM Symposium on the Principles of Programming Languages, pages 7\u201321, 1985.","DOI":"10.1145\/318593.318603"},{"key":"56_CR16","first-page":"456","volume":"68","author":"J. C. Reynolds","year":"1969","unstructured":"J. C. Reynolds. Automatic computation of data set definitions. Information Processing, 68:456\u2013461, 1969.","journal-title":"Information Processing"},{"key":"56_CR17","doi-asserted-by":"crossref","unstructured":"K. Stefansson. Systems of set constraints with negative constraints are NEXPTIME-complete. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 137\u2013141, 1994.","DOI":"10.1109\/LICS.1994.316077"},{"key":"56_CR18","unstructured":"J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bj\u00d8rner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573\u2013581. North-Holland, 1988."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:52:43Z","timestamp":1736517163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0055809","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}