{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:22:54Z","timestamp":1778300574183,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540643012","type":"print"},{"value":"9783540697213","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052372","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"211-225","source":"Crossref","is-referenced-by-count":12,"title":["Co-definite set constraints"],"prefix":"10.1007","author":[{"given":"Witold","family":"Charatonik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"17_CR1","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":"17_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01744297","volume":"13","author":"A. Arnold","year":"1980","unstructured":"A. Arnold and M. Nivat. Formal computations of non deterministic recursive program schemes. Mathematical Systems Theory, 13:219\u2013236, 1980.","journal-title":"Mathematical Systems Theory"},{"key":"17_CR3","unstructured":"A. Arnold and D. Niwinski. Fixed point characterization of weak monadic logic definable sets of trees. In M. Nivat and A. Podelski, editors, Tree Automata and Languages, pages 159\u2013188. North Holland, 1992."},{"key":"17_CR4","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":"17_CR5","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Proceedings of the 35th Symposium on Foundations of Computer Science, pages 642\u2013653, 1994.","DOI":"10.1109\/SFCS.1994.365727"},{"key":"17_CR6","unstructured":"W. Charatonik and A. Podelski. Set constraints for greatest models. Technical Report MPI-I-97-2-004, Max-Planck-Institut f\u00fcr Informatik, April 1997. www.mpisb.mpg.de\/~podelski\/papers\/greatest.html."},{"key":"17_CR7","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":"17_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BFb0017430","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"P. Devienne","year":"1997","unstructured":"P. Devienne, J.-M. Talbot, and S. Tison. Solving classes of set constraints with tree automata. Technical Report IT-303, Laboratoire d'Informatique Fondamentale de Lille, May 1997."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"T. Friihwirth, E. Shapiro, M. 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":"17_CR10","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984."},{"key":"17_CR11","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":"17_CR12","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":"17_CR13","unstructured":"N. Heintze and J. Jaffar. Semantic types for logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 141\u2013156. MIT Press, 1992."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. Set constraints and set-based analysis. In Proceedings of the Workshop on Principles and Practice of Constraint Programming, LNCS 874, pages 281\u2013298. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58601-6_107"},{"key":"17_CR15","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":"17_CR16","volume-title":"Symbolic Computation","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, Berlin, Germany, second, extended edition, 1987.","edition":"second, extende"},{"key":"17_CR17","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, 11th Annual IEEE Symposium on Logic in Computer Science, pages 138\u2013147, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press."},{"key":"17_CR18","unstructured":"P. Mishra. Towards a theory of types in Prolog. In IEEE International Symposium on Logic Programming, pages 289\u2013298, 1984."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"D. Niwinski. On fixed-point clones. In L. Kott, editor, Proceedings of the 13th International Conference on Automata, Languages and Programming, volume 226 of Lecture Notes in Computer Science, pages 464\u2013473. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16761-7_96"},{"key":"17_CR20","volume-title":"Proceedings of the Third International Conference on Principles and Practice of Constraint Programming \u2014CP97, volume 1330 of Springer LNCS","author":"L. Pacholski","year":"1997","unstructured":"L. Pacholski and A. Podelski. Set constraints \u2014a pearl in research on constraints. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming \u2014CP97, volume 1330 of Springer LNCS, Berlin, Germany, October 1997. Springer-Verlag."},{"key":"17_CR21","unstructured":"A. Podelski, W. Charatonik, and M. M\u00fcller. Set-based error diagnosis of concurrent constraint programs. submitted for publication, 1997."},{"key":"17_CR22","doi-asserted-by":"publisher","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":"17_CR23","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"},{"issue":"2","key":"17_CR24","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"Moshe Y. Vardi","year":"1986","unstructured":"M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32, 1986.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:11:39Z","timestamp":1736406699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0052372","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}