{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:21:38Z","timestamp":1648664498611},"publisher-location":"Berlin, Heidelberg","reference-count":99,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540637530","type":"print"},{"value":"9783540696421","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0017466","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:46Z","timestamp":1132644166000},"page":"549-561","source":"Crossref","is-referenced-by-count":12,"title":["Set constraints: A pearl in research on constraints"],"prefix":"10.1007","author":[{"given":"Leszek","family":"Pacholski","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"42_CR1","volume-title":"Solvable Cases of the Decision Problem","author":"W. Ackermann","year":"1954","unstructured":"W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, Amsterdam, 1954."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken. Set constraints: Results, applications and future directions. In Proceedings of the Workshop on Principles and Practice of Constraint Programming, LNCS 874, pages 326\u2013335. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58601-6_110"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, M. Y. Vardi, and E. L. Wimmers. The complexity of set constraints. In 1993 Conference on Computer Science Logic, LNCS 832, pages 1\u201317. Springer-Verlag, Sept. 1993.","DOI":"10.1007\/BFb0049320"},{"issue":"1","key":"42_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1006\/inco.1995.1139","volume":"122","author":"A. Aiken","year":"1995","unstructured":"A. Aiken, D. Kozen, and E. L. Wimmers. Decidability of systems of set constraints with negative constraints. Information and Computation, 122(1):30\u201344, Oct. 1995.","journal-title":"Information and Computation"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"A. Aiken and B. Murphy. Implementing regular tree expressions. In ACM Conference on Functional Programming Languages and Computer Architecture, pages 427\u2013447, August 1991.","DOI":"10.1007\/3540543961_21"},{"key":"42_CR6","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":"42_CR7","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture, pages 31\u201341, Copenhagen, Denmark, June 1993.","DOI":"10.1145\/165180.165188"},{"key":"42_CR8","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."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. L. Wimmers, and T. Lakshman. Soft typing with conditional types. In Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, Jan. 1994.","DOI":"10.1145\/174675.177847"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"D. Arden. Delayed logic and finite state machines. In Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design, pages 133\u2014151, 1961.","DOI":"10.1109\/FOCS.1961.13"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Eighth Annual IEEE Symposium on Logic in Computer Science, pages 75\u201383,1993.","DOI":"10.1109\/LICS.1993.287598"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"C. Beeri, S. Nagvi, O. Schmueli, and S. Tsur. Set constructors in a logic database language. The Journal of Logic Programming, pages 181\u2013232, 1991.","DOI":"10.1016\/0743-1066(91)90036-O"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"S. K. Biswas. A demand-driven set-based analysis. In The 24th ACM Symposium on Principles of Programming Languages POPL '97, pages 372\u2013385, Paris, France, January 1997.","DOI":"10.1145\/263699.263753"},{"key":"42_CR14","unstructured":"B. Bogaert and S. Tison. Automata with equality tests. Technical Report IT 207, Laboratoire d'Informatique Fondamentale de Lille, 1991."},{"key":"42_CR15","unstructured":"P. Bruscoli, A. Dovier, E. Pontelli, and G. Rossi. Compiling intensional sets in CLP. In Proceedings of the International Conference on Logic Programming, pages 647\u2013661. The MIT Press, 1994."},{"key":"42_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J. Brzozowski","year":"1980","unstructured":"J. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theorical Computer Science, 10:19\u201335, 1980.","journal-title":"Theorical Computer Science"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"W. Charatonik. Set constraints in some equational theories. In 1st International Conference Constraints in Computational Logics, LNCS 845, pages 304\u2013319. Springer-Verlag, 1994. Also to appear in Information and Computation.","DOI":"10.1007\/BFb0016862"},{"key":"42_CR18","unstructured":"W. Charatonik. Set constraints in some equational theories. PhD thesis, Polish Academy of Sciences, 1995."},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Negative set constraints with equality. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 128\u2013136, 1994.","DOI":"10.1109\/LICS.1994.316078"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Proceedings of the 35 th Symposium on Foundations of Computer Science, pages 642\u2013653, 1994.","DOI":"10.1109\/SFCS.1994.365727"},{"key":"42_CR21","unstructured":"W. Charatonik and L. Pacholski. Negative set constraints: an easy proof of decidability. Technical Report MPI-I-93-265, Max-Planck Institute f\u00fcr Informatik, December 1993."},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"W. Charatonik and A. Podelski. The independence property of a class of set constraints. In Conference on Principles and Practice of Constraint Programming, LNCS 1118, pages 76\u201390. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61551-2_67"},{"key":"42_CR23","unstructured":"W. Charatonik and A. Podelski. Set constraints for greatest models. Technical Report MPI-I-97-2-004, Max-Planck-Institut fiir Informatik, April 1997. http:\/\/www.mpi-sb.mpg.de\/-podelski\/papers\/greatest.html."},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"W. Charatonik and A. Podelski. Set constraints with intersection. In G. Winskel, editor, Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 362\u2013372. IEEE, June 1997.","DOI":"10.1109\/LICS.1997.614962"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"A. Cheng and D. Kozen. A complete Gentzen-style axiomatization for set constraints. In ICALP: Annual International Colloquium on Automata, Languages and Programming, LNCS 1099, 1996.","DOI":"10.1007\/3-540-61440-0_123"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. POPL '92, pages 83\u201394. ACM Press, 1992.","DOI":"10.1145\/143165.143184"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Record of FPCA '95-Conference on Functional Programming and Computer Architecture, pages 170\u2013181, La Jolla, California, USA, 25\u201328 June 1995. SIGPLAN\/SIGARCH\/WG2.8, ACM Press, New York, USA.","DOI":"10.1145\/224164.224199"},{"key":"42_CR28","unstructured":"P. W. Dart and J. Zobel. A regular type language for logic programs, chapter 5, pages 157\u2013188. MIT Press, 1992."},{"key":"42_CR29","volume-title":"Proceedings of the Third International Conference on Principles and Practice of Constraint Programming","author":"P. Devienne","year":"1997","unstructured":"P. Devienne, J.-M. Talbot, and S. Tison. Solving classes of set constraints with tree automata. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming \u2014 CP97, LNCS, Berlin, Germany, October 1997. Springer-Verlag. To appear."},{"key":"42_CR30","unstructured":"A. Dovier. Computable Set Theory and Logic Programming. PhD thesis, Dipartimento di Informatica, Universit\u00e1 di Pisa, 1996."},{"key":"42_CR31","unstructured":"A. Dovier and G. Rossi. Embedding Extensional Finite Sets in CLP. In International Logic Programming Symposium, 1993."},{"key":"42_CR32","series-title":"Computer Science Division Tech Report 96-917","volume-title":"Making set-constraint based program analyses scale","author":"M. Fiihndrich","year":"1996","unstructured":"M. Fiihndrich and A. Aiken. Making set-constraint based program analyses scale. Computer Science Division Tech Report 96-917, Computer Science Division, University of California at Berkeley, September 1996. Also presented at the Workshop on Set Constraints, Cambridge MA, August 1996."},{"key":"42_CR33","unstructured":"J. S. Foster. CLP(SC): Implementation and efficiency considerations. workshop on set constraints. Available at http:\/\/http.cs.berkeley.edu\/~jfoster\/. Presented at the Workshop on Set Constraints, Cambridge MA, August 1996, August 1996."},{"key":"42_CR34","series-title":"Computer Science Division Tech Report 97-964","volume-title":"Flow-insensitive points-to analysis with term and set constraints","author":"J. S. Foster","year":"1997","unstructured":"J. S. Foster, M. F\u00e4hndrich, and A. Aiken. Flow-insensitive points-to analysis with term and set constraints. Computer Science Division Tech Report 97-964,, University of California at Berkeley, September 1997. Also presented at the Workshop on Set Constraints, Cambridge MA, August 1996"},{"key":"42_CR35","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M. Y. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 300\u2013309, July 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"42_CR36","unstructured":"J. P. Gallagher, D. Boulanger, and H. Saglam. Practical model-based static analysis for definite logic programs. In Proceedings of the 1995 International Symposium on Logic Programming, pages 351\u2013368."},{"key":"42_CR37","doi-asserted-by":"crossref","unstructured":"J. P. Gallagher and L. Lafave. Regular approximation of computation paths in logic and functional languages. In Proceedings of the Dagstuhl Workshop on Partial Evaluation, pages 1\u201316. Springer-Verlag, February 1996.","DOI":"10.1007\/3-540-61580-6_7"},{"key":"42_CR38","doi-asserted-by":"crossref","unstructured":"K. L. S. Gasser, F. Nielson, and H. R. Nielson. Systematic realisation of control flow analyses for CML. In Proceedings of ICFP'97, pages 38\u201351. ACM Press, 1997.","DOI":"10.1145\/258948.258954"},{"key":"42_CR39","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akademiai Kiado, Budapest, 1984."},{"key":"42_CR40","unstructured":"C. Gervet. Conjunto: Constraint logic programming with finite set domains. In M. Bruynooghe, editor, Proceedings of the International Logic Programming Symposium, pages 339\u2013358, 1994."},{"key":"42_CR41","unstructured":"C. Gervet. Set Intervals in Constraint-Logic Programming: Definition and Implementation of a Language. PhD thesis, Universit\u00e9 de Franche-Compt\u00e9, 1995. European Thesis."},{"key":"42_CR42","doi-asserted-by":"crossref","unstructured":"C. Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints, l(2), 1997.","DOI":"10.1007\/BF00137870"},{"key":"42_CR43","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":"42_CR44","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. Full version in [45].","DOI":"10.1109\/SFCS.1993.366850"},{"key":"42_CR45","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. Technical Report IT 247, Laboratoire d'Informatique Fondamentale de Lille, 1993."},{"key":"42_CR46","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Set constraints and automata. Technical Report IT 292, Laboratoire d'Informatique Fondamentale de Lille, 1996."},{"key":"42_CR47","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommassi. Some new decidability results on positive and negative set constraints. In 1st International Conference Constraints in Computational Logics, LNCS 845, pages 336\u2013351. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0016864"},{"key":"42_CR48","unstructured":"N. Heintze. Set based program analysis. PhD thesis, School of Computer Science, Carnegie Mellon University, 1992."},{"key":"42_CR49","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set based analysis of arithmetic. Draft manuscript, July 1993.","DOI":"10.21236\/ADA274112"},{"key":"42_CR50","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set based analysis of ML programs. Technical Report CMU-CS-93193, School of Computer Science, Carnegie Mellon University, July 1993.","DOI":"10.21236\/ADA270597"},{"key":"42_CR51","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set based analysis of ML programs. In Conference on Lisp and Functional Programming, pages 306\u2013317. ACM, 1994. Preliminary version in [50].","DOI":"10.1145\/182409.182495"},{"key":"42_CR52","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":"42_CR53","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":"42_CR54","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. Technical report, School of Computer Science, Carnegie Mellon University, Aug. 1990. 66 pages.","DOI":"10.1145\/96709.96729"},{"key":"42_CR55","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. An engine for logic program analysis. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, pages 318\u2013328, 1992.","DOI":"10.1109\/LICS.1992.185544"},{"key":"42_CR56","unstructured":"N. Heintze and J. Jaffar. Semantic Types for Logic Programs, chapter 4, pages 141\u2013156. MIT Press, 1992."},{"key":"42_CR57","doi-asserted-by":"crossref","unstructured":"N. Heintze and D. McAllester. Linear-time subtransitive control-flow analysis. In ACM Conference on Programming Language Design and Implementation, 1997. To appear.","DOI":"10.1145\/258915.258939"},{"key":"42_CR58","doi-asserted-by":"crossref","unstructured":"N. Heintze and D. McAllester. On the cubic bottleneck in subtyping and flow analysis. In G. Winskel, editor, Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 342\u2013351. IEEE, June 1997.","DOI":"10.1109\/LICS.1997.614960"},{"key":"42_CR59","unstructured":"ILOG. ILOG SOLVER 3.2 user manual.www.ilog.com."},{"key":"42_CR60","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"},{"issue":"3","key":"42_CR61","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"W. Joyner","year":"1979","unstructured":"W. Joyner. Resolution strategies as decision procedures. Journal of the Association for Computing Machinery, 23(3):398\u2013417, 1979.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"42_CR62","doi-asserted-by":"crossref","unstructured":"D. Kozen. Logical aspects of set constraints. In 1993 Conference on Computer Science Logic, LNCS 832, pages 175\u2013188. Springer-Verlag, Sept. 1993.","DOI":"10.1007\/BFb0049332"},{"key":"42_CR63","unstructured":"D. Kozen. Set constraints and logic programming (abstract). In 1st International Conference Constraints in Computational Logics, LNCS 845. Springer-Verlag, 1994. Also to appear in Information and Computation."},{"key":"42_CR64","doi-asserted-by":"crossref","unstructured":"D. Kozen. Rational spaces and set constraints. In TAPSOFT: 6th International Joint Conference on Theory and Practice of Software Development, LNCS 915, pages 42\u201361. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59293-8_186"},{"issue":"1-2","key":"42_CR65","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(96)00070-9","volume":"167","author":"D. Kozen","year":"1996","unstructured":"D. Kozen. Rational spaces and set constraints. Theoretical Computer Science, 167(1-2):73\u201394, October 1996.","journal-title":"Theoretical Computer Science"},{"key":"42_CR66","volume-title":"Logic programming with sets","author":"G. Kuper","year":"1990","unstructured":"G. Kuper. Logic programming with sets. New York, NY, 1990. Academic Press."},{"key":"42_CR67","doi-asserted-by":"crossref","unstructured":"B. Legeard and E. Legros. Short Overview of the CLPS System. 1991.","DOI":"10.1007\/3-540-54444-5_123"},{"key":"42_CR68","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01458217","volume":"76","author":"L. L\u00f6wenheim","year":"1915","unstructured":"L. L\u00f6wenheim. \u00dcber M\u00f6glichkeiten im Relativkalk\u00fcl. Mathematische Annalen, 76:228\u2013251, 1915.","journal-title":"Mathematische Annalen"},{"key":"42_CR69","unstructured":"D. McAllester and N. Heintze. On the complexity of set-based analysis. www.ai.mit.edu\/people\/dam\/setbased.ps."},{"key":"42_CR70","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/LICS.1996.561313","volume-title":"Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science","author":"D. A. McAllester","year":"1996","unstructured":"D. A. McAllester, R. Givan, C. Witty, and D. Kozen. Tarskian set constraints. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 138\u2013147, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press."},{"key":"42_CR71","unstructured":"P. Mishra. Towards a theory of types in Prolog. In IEEE International Symposium on Logic Programming, pages 289\u2013298, 1984."},{"key":"42_CR72","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":"42_CR73","unstructured":"M. M\u00fcller. Type Analysis for a Higher-Order Concurrent Constraint Language. PhD thesis, Universit\u00e4t des Saarlandes, Technische Fakult\u00e4t, 66041 Saarbr\u00fccken, Germany, expected 1997."},{"key":"42_CR74","doi-asserted-by":"crossref","unstructured":"M. M\u00fcller, J. Niehren, and A. Podelski. Inclusion constraints over non-empty sets of trees. In M. Bidoit and M. Dauchet, editors, Proceedings of the 9th International Joint Conference on Theory and Practice of Software Development (TAPSOFT), volume 1214 of LNCS, pages 345\u2013356, Berlin, April 1997. Springer-Verlag.","DOI":"10.1007\/BFb0030609"},{"key":"42_CR75","volume-title":"Proceedings of the Third International Conference on Principles and Practice of Constraint Programming","author":"M. M\u00fcller","year":"1997","unstructured":"M. M\u00fcller, J. Niehren, and A. Podelski. Ordering constraints over feature trees. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming \u2014 CP97, LNCS, Berlin, Germany, October 1997. Springer-Verlag. To appear."},{"key":"42_CR76","unstructured":"T. M\u00fcller and M. M\u00fcller. Finite set constraints in Oz. In 13. Workshop Logische Programmierung, Technische Universit\u00e4t M\u00fcnchen, September 1997. to appear."},{"key":"42_CR77","volume-title":"Tree Automata and Languages","author":"M. Nivat","year":"1992","unstructured":"M. Nivat and A. Podelski. Tree Automata and Languages. North-Holland, Amsterdam, 1992."},{"key":"42_CR78","doi-asserted-by":"crossref","unstructured":"J. Palsberg and O'Keefe. A type system equivalent to flow analysis. In Symposium of Principles of Programming Languages, pages 367\u2013378. ACM, 1995.","DOI":"10.1145\/199448.199533"},{"issue":"1","key":"42_CR79","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1006\/inco.1995.1058","volume":"118","author":"J. Palsberg","year":"1995","unstructured":"J. Palsberg and M. Schwartzbach. Safety analysis versus type inference. Information and Computation, 118(1):128\u2013141, April 1995.","journal-title":"Information and Computation"},{"key":"42_CR80","doi-asserted-by":"crossref","unstructured":"A. Podelski, W. Charatonik, and M. M\u00fcller. Set-based analysis of reactive infinite-state systems. Submitted for publication, 1997.","DOI":"10.1007\/BFb0054183"},{"key":"42_CR81","unstructured":"J. F. Puget. Finite Set Intervals. In Proceedings of the Second International Workshop on Set Constraints, Cambridge, Massachusetts, 1996."},{"key":"42_CR82","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":"42_CR83","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(94)00130-8","volume":"52","author":"H. Seidl","year":"1994","unstructured":"H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52:57\u201360, 1994.","journal-title":"Information Processing Letters"},{"key":"42_CR84","first-page":"357","volume-title":"Proceedings of the 9th International Joint Conference on Theory and Practice of Software Development (TAPSOFT), volume 1214 of LNCS","author":"F. Seynhave","year":"1997","unstructured":"F. Seynhave, M. Tommasi, and R. Treinen. Grid structures and undecidable constraint theories. In M. Bidoit and M. Dauchet, editors, Proceedings of the 9th International Joint Conference on Theory and Practice of Software Development (TAPSOFT), volume 1214 of LNCS, pages 357\u2013368, Berlin, April 1997. Springer-Verlag."},{"key":"42_CR85","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(85)90077-5","volume":"41","author":"G. Slutzki","year":"1985","unstructured":"G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41:305\u2013318, 1985.","journal-title":"Theoretical Computer Science"},{"key":"42_CR86","doi-asserted-by":"crossref","unstructured":"G. Smolka. The Oz programming model. In Volume 1000 of Lecture Notes in Computer Science, 1995.","DOI":"10.1007\/BFb0015252"},{"key":"42_CR87","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":"42_CR88","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-94-009-0349-4_15","volume-title":"Frontiers in Combining Systems","author":"F. Stolzenburg","year":"1996","unstructured":"F. Stolzenburg. Membership-constraints and complexity in logic programming with sets. In F. Baader and K. U. Schulz, editors, Frontiers in Combining Systems, pages 285\u2013302. Kluwer Academic, Dordrecht, The Netherlands, 1996."},{"key":"42_CR89","doi-asserted-by":"crossref","unstructured":"S. Thatte. Type inference with partial types. In 15th International Colloquium on Automata, Languages and Programming, volume 317 of LNCS, pages 615\u2013629. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"42_CR90","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":"42_CR91","doi-asserted-by":"crossref","unstructured":"T. E. Uribe. Sorted unification using set constraints. In 11th International Conference on Automated Deduction, LNAI 607, pages 163\u2013177. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55602-8_163"},{"key":"42_CR92","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume":"1043","author":"M. Y. Vardi","year":"1996","unstructured":"M. Y. Vardi. An automata-theoretic approach to linear-temporal logic. In Logics for Concurrency: Structure versus Automata. LNCS, 1043:238\u2013266, 1996.","journal-title":"In Logics for Concurrency: Structure versus Automata"},{"key":"42_CR93","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci., 32, 1986.","DOI":"10.1016\/0022-0000(86)90026-7"},{"key":"42_CR94","unstructured":"C. Walinsky. CLP(\u03a3E *): Constraint Logic Programming with Regular Sets. In Proceedings of the International Conference on Logic Programming, pages 181\u2013190, 1989."},{"key":"42_CR95","unstructured":"E. Yardeni,, T. Fr\u00fchwirth, and E. Shapiro. Polymorphically typed logic programs, chapter 2, pages 157\u2013188. MIT Press, 1992."},{"key":"42_CR96","unstructured":"E. Yardeni. A type system for logic programs. Master's thesis, Weizmann Institute of Science, 1987."},{"key":"42_CR97","unstructured":"E. Yardeni and E. Shapiro. A type system for logic programs, volume 2, chapter 28, pages 211\u2013244. The MIT Press, 1987."},{"key":"42_CR98","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1991","unstructured":"E. Yardeni and E. Shapiro. A type system for logic programs. Journal of Logic Programming, 10:125\u2013153, 1991. Preliminary version in [97].","journal-title":"Journal of Logic Programming"},{"key":"42_CR99","unstructured":"J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bj\u00f8rner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573\u2013581. North-Holland, 1988."}],"container-title":["Principles and Practice of Constraint Programming-CP97","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:54:28Z","timestamp":1586573668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637530","9783540696421"],"references-count":99,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0017466","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1997]]}}}