{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:20Z","timestamp":1742598620987,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_186","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:12:13Z","timestamp":1330276333000},"page":"42-61","source":"Crossref","is-referenced-by-count":3,"title":["Rational spaces and set constraints"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","unstructured":"A. Aiken, D. Kozen, M. Vardi, and E. Wimmers, The complexity of set constraints, in Proc. 1993 Conf. Computer Science Logic (CSL'93), E. B\u00f6rger, Y. Gurevich, and K. Meinke, eds., vol. 832 of Lect. Notes in Comput. Sci., Eur. Assoc. Comput. Sci. Logic, Springer, September 1993, pp. 1\u201317."},{"key":"3_CR2","unstructured":"A. Aiken, D. Kozen, and E. Wimmers, Decidability of systems of set constraints with negative constraints, Infor. and Comput., (1995). To appear. Also Cornell University Tech. Report 93\u20131362, June, 1993."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"A. Aiken and B. Murphy, Implementing regular tree expressions, in Proc. 1991 Conf. Functional Programming Languages and Computer Architecture, August 1991, pp. 427\u2013447.","DOI":"10.1007\/3540543961_21"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Static type inference in a dynamically typed language, in Proc. 18th Symp. Principles of Programming Languages, ACM, January 1991, pp. 279\u2013290.","DOI":"10.1145\/99583.99621"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers, Solving systems of set constraints, in Proc. 7th Symp. Logic in Computer Science, IEEE, June 1992, pp. 329\u2013340.","DOI":"10.1109\/LICS.1992.185545"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger, and U. Waldmann, Set constraints are the monadic class, in Proc. 8th Symp. Logic in Computer Science, IEEE, June 1993, pp. 75\u201383.","DOI":"10.1109\/LICS.1993.287598"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski, Negative set constraints with equality, in Proc. 9th Symp. Logic in Computer Science, IEEE, July 1994, pp. 128\u2013136.","DOI":"10.1109\/LICS.1994.316078"},{"key":"3_CR8","unstructured":"Set constraints with projections are in NEXPTIME, in Proc. 35th Symp. Foundations of Computer Science, IEEE, November 1994, pp. 642\u2013653."},{"key":"3_CR9","unstructured":"J. Englefriet, Tree automata and tree grammars, Tech. Rep. DAIMI FN-10, Aarhus University, April 1975."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi, Solving systems of set constraints using tree automata, in Proc. Symp. Theor. Aspects of Comput. Sci., vol. 665, Springer-Verlag Lect. Notes in Comput. Sci., February 1993, pp. 505\u2013514.","DOI":"10.1007\/3-540-56503-5_50"},{"key":"3_CR11","unstructured":"Solving systems of set constraints with negated subset relationships, in Proc. 34th Symp. Foundations of Comput. Sci., IEEE, November 1993, pp. 372\u2013380."},{"key":"3_CR12","unstructured":"N. Heintze, Set Based Program Analysis, PhD thesis, Carnegie Mellon University, 1993."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar, A decision procedure for a class of set constraints, in Proc. 5th Symp. Logic in Computer Science, IEEE, June 1990, pp. 42\u201351.","DOI":"10.1109\/LICS.1990.113732"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"A finite presentation theorem for approximating logic programs, in Proc. 17th Symp. Principles of Programming Languages, ACM, January 1990, pp. 197\u2013209.","DOI":"10.1145\/96709.96729"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"N. D. Jones and S. S. Muchnick, Flow analysis and optimization of LISP-like structures, in Proc. 6th Symp. Principles of Programming Languages, ACM, January 1979, pp. 244\u2013256.","DOI":"10.1145\/567752.567776"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"891","DOI":"10.2307\/2372123","volume":"73","author":"B. J\u00f3nsson","year":"1951","unstructured":"B. J\u00f3nsson and A. Tarski, Boolean algebras with operators, Amer. J. Math., 73 (1951), pp. 891\u2013939.","journal-title":"Amer. J. Math."},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/2372074","volume":"74","author":"B. J\u00f3nsson","year":"1952","unstructured":", Boolean algebras with operators, Amer. J. Math., 74 (1952), pp. 127\u2013162.","journal-title":"Amer. J. Math."},{"key":"3_CR18","unstructured":"D. Kozen, Logical aspects of set constraints, in Proc. 1993 Conf. Computer Science Logic (CSL'93), E. B\u00f6rger, Y. Gurevich, and K. Meinke, eds., vol. 832 of Lect. Notes in Comput. Sci., Eur. Assoc. Comput. Sci. Logic, Springer, September 1993, pp. 175\u2013188."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Set constraints and logic programming (abstract), in Proc. First Conf. Constraints in Computational Logics (CCL'94), J.-P. Jouannaud, ed., vol. 845 of Lect. Notes in Comput. Sci., ESPRIT, Springer, September 1994, pp. 302\u2013303. Full version available as: Set constraints and logic programming, Tech. Rep. 94\u20131467, Cornell University, November 1994.","DOI":"10.1007\/BFb0016861"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"D. Kozen, J. Palsberg, and M. I. Schwartzbach, Efficient recursive subtyping, in Proc. 20th Symp. Princip. Programming Lang., ACM, January 1993, pp. 419\u2013428.","DOI":"10.1145\/158511.158700"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0022-0000(05)80051-0","volume":"49","author":"D. Kozen","year":"1994","unstructured":", Efficient inference of partial types, J. Comput. Syst. Sci., 49 (1994), pp. 306\u2013324.","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR22","unstructured":"P. Mishra, Towards a theory of types in PROLOG, in Proc. 1st Symp. Logic Programming, IEEE, 1984, pp. 289\u2013298."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. Reddy, Declaration-free type checking, in Proc. 12th Symp. Principles of Programming Languages, ACM, 1985, pp. 7\u201321.","DOI":"10.1145\/318593.318603"},{"key":"3_CR24","unstructured":"J. C. Reynolds, Automatic computation of data set definitions, in Information Processing 68, North-Holland, 1969, pp. 456\u2013461."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"K. Stef\u00e1nsson, Systems of set constraints with negative constraints are NEXPTIME-complete, in Proc. 9th Symp. Logic in Computer Science, IEEE, June 1994, pp. 137\u2013141.","DOI":"10.1109\/LICS.1994.316077"},{"key":"3_CR26","unstructured":"J. Young and P. O'keefe, Experience with a type evaluator, in Partial Evaluation and Mixed Computation, D. Bj\u00f8rner, A. P. Ershov, and N. D. Jones, eds., North-Holland, 1988, pp. 573\u2013581."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_186.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:45:31Z","timestamp":1742597131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_186","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}