{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:04Z","timestamp":1725460024262},"publisher-location":"Berlin\/Heidelberg","reference-count":32,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582770"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0049332","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T18:58:16Z","timestamp":1141671496000},"page":"175-188","source":"Crossref","is-referenced-by-count":5,"title":["Logical aspects of set constraints"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"A. Aiken, D. Kozen, M. Vardi, and E. Wimmers, The complexity of set constraints. This volume."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, and E. Wimmers, Decidability of systems of set constraints with negative constraints, Tech. Rep. 93-1362, Computer Science Department, Cornell University, June 1993.","DOI":"10.7146\/brics.v1i32.21611"},{"key":"13_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":"13_CR4","unstructured":"-, Static type inference in a dynamically typed language, in Proc. 18th Symp. Principles of Programming Languages, ACM, January 1991, pp. 279\u2013290."},{"key":"13_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":"13_CR6","doi-asserted-by":"crossref","unstructured":"R. M. Amadio and L. Cardelli, Subtyping recursive types, in Proc. 18th Symp. Princip. Programming Lang., ACM, January 1991, pp. 104\u2013118.","DOI":"10.1145\/99583.99600"},{"key":"13_CR7","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"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"L. Cardelli and P. Wegner, On understanding types, data abstraction, and polymorphism, Computing Surveys, 17:4 (1985), pp. 471\u2013522.","journal-title":"Computing Surveys"},{"key":"13_CR9","unstructured":"W. Charatonik and L. Pacholski, Negative set constraints with equality, in Proc. 9th Symp. Logic in Computer Science, IEEE, July 1994. To appear. Also, Max-Planck-Institut f\u00fcr Informatik Technical Report MPI-I-93-265."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"B. F. Chellas, Modal Logic: An Introduction, Cambridge University Press, 1980.","DOI":"10.1017\/CBO9780511621192"},{"key":"13_CR11","unstructured":"A. Colmerauer, PROLOG and infinite trees, in Logic Programming, S.-A. T\u00e4rnlund and K. L. Clark, eds., Academic Press, January 1982, pp. 231\u2013251."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle, Fundamental properties of infinite trees, Theor. Comput. Sci., 25 (1983), pp. 95\u2013169.","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","unstructured":"B. Dreben and W. D. Goldfarb, The Decision Problem: Solvable Classes of Quantificational formulas, Addison Wesley, 1979."},{"key":"13_CR14","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":"13_CR15","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":"13_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0168-0072(89)90032-8","volume":"44","author":"R. Goldblatt","year":"1989","unstructured":"R. Goldblatt, Varieties of complex algebras, Annals of Pure and Applied Logic, 44 (1989), pp. 173\u2013242.","journal-title":"Annals of Pure and Applied Logic"},{"key":"13_CR17","unstructured":"-, Mathematics of Modality, vol. 43 of CSLI Lecture Notes, Center for the Study of Language and Information, 1993."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"P. R. Halmos, Lectures on Boolean algebras, Springer-Verlag, 1974.","DOI":"10.1007\/978-1-4612-9855-7"},{"key":"13_CR19","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":"13_CR20","unstructured":"-, A finite presentation theorem for approximating logic programs, in Proc. 17th Symp. Principles of Programming Languages, ACM, January 1990, pp. 197\u2013209."},{"key":"13_CR21","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":"13_CR22","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":"13_CR23","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":"13_CR24","doi-asserted-by":"crossref","unstructured":"D. Kozen, J. Palsberg, and M. I. Schwartzbach, Efficient inference of partial types, in Proc. 33rd Symp. Found. Comput. Sci., IEEE, October 1992, pp. 363\u2013371.","DOI":"10.1109\/SFCS.1992.267754"},{"key":"13_CR25","unstructured":"-, Efficient recursive subtyping, in Proc. 20th Symp. Princip. Programming Lang., ACM, January 1993, pp. 419\u2013428."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"D. Kozen and J. Tiuryn, Logics of programs, in Handbook of Theoretical Computer Science, van Leeuwen, ed., vol. B, North Holland, 1990, pp. 789\u2013840.","DOI":"10.1016\/B978-0-444-88074-1.50019-6"},{"key":"13_CR27","unstructured":"P. Mishra, Towards a theory of types in PROLOG, in Proc. 1st Symp. Logic Programming, IEEE, 1984, pp. 289\u2013298."},{"key":"13_CR28","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":"13_CR29","unstructured":"J. C. Reynolds, Automatic computation of data set definitions, in Information Processing 68, North-Holland, 1969, pp. 456\u2013461."},{"key":"13_CR30","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. To appear. Also Cornell University TR93-1380, August 1993."},{"key":"13_CR31","unstructured":"Y. Venema, Many-Dimensional Modal Logic, PhD thesis, Universiteit van Amsterdam, January 1992."},{"key":"13_CR32","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","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049332.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:43Z","timestamp":1607550943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582770"],"references-count":32,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0049332","relation":{},"subject":[]}}