{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:46:47Z","timestamp":1752461207097,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030609","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:10:41Z","timestamp":1133417441000},"page":"345-356","source":"Crossref","is-referenced-by-count":11,"title":["Inclusion constraints over non-empty sets of trees"],"prefix":"10.1007","author":[{"given":"Martin","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, and E. Wimmers. Decidability of Systems of Set Constraints with Negative Constraints. Information and Computation, 1995.","DOI":"10.1006\/inco.1995.1139"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers. Solving Systems of Set Constraints. In Proc. 7 th LICS pp. 329\u2013340. IEEE, 1992.","DOI":"10.1109\/LICS.1992.185545"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers. Type Inclusion Constraints and Type Inference. In Proc. 6 th FPCA, pp. 31\u201341. 1993.","DOI":"10.1145\/165180.165188"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. Wimmers, and T. Lakshman. Soft Typing with Conditional Types. In Proc. 21 st POPL. ACM, 1994.","DOI":"10.1145\/174675.177847"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger, and U. Waldmann. Set Constraints are the Monadic Class. In Proc. 8 th LICS, pp. 75\u201383. IEEE, 1993.","DOI":"10.1109\/LICS.1993.287598"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"H. P. Barendregt. The Type Free Lambda Calculus. In Barwise [7], 1977.","DOI":"10.1016\/S0049-237X(08)71129-7"},{"key":"28_CR7","unstructured":"J. Barwise, ed. Handbook of Mathematical Logic. Number 90 in Studies in Logic. North-Holland, 1977."},{"key":"28_CR8","unstructured":"D. Basin and H. Ganzinger. Automated Complexity Analysis Based on Ordered Resolution. In 11 th LICS. IEEE, 1996."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. 9 th LICS, pp. 128\u2013136. 1994.","DOI":"10.1109\/LICS.1994.316078"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Proc. 35 th FOCS, pp. 642\u2013653. 1994.","DOI":"10.1109\/SFCS.1994.365727"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"W. Charatonik and A. Podelski. The Independence Property of a Class of Set Constraints. In Proc. 2nd CP. LNCS 1118, Springer, 1996.","DOI":"10.1007\/3-540-61551-2_67"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371\u2013425. 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. In Proc. 34 nd FOCS, pp. 372\u2013380. 1993.","DOI":"10.1109\/SFCS.1993.366850"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set Based Analysis of ML Programs. Technical Report CMU-CS-93-193, School of Computer Science, Carnegie Mellon University. July 1993.","DOI":"10.21236\/ADA270597"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints (Extended Abstract). In Proc. 5 th LICS, pp. 42\u201351. IEEE, 1990.","DOI":"10.1109\/LICS.1990.113732"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"D. Kozen. Logical aspects of set constraints. In Proc. CSL, pp. 175\u2013188. 1993.","DOI":"10.1007\/BFb0049332"},{"key":"28_CR17","unstructured":"M. J. Maher. Logic semantics for a class of committed-choice programs. In J.-L. Lassez, ed., Proc. 4 th ICLP, pp. 858\u2013876. The MIT Press, 1987."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"M. J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In Proc. 3 rd LICS, pp. 348\u2013457. IEEE, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"A. I. Malc'ev. Axiomatizable Classes of Locally Free Algebras of Various Type. In The Metamathematics of Algebraic Systens: Collected Papers 1936\u20131967, ch. 23, pp. 262\u2013281. North-Holland, 1971.","DOI":"10.1016\/S0049-237X(08)70560-3"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"D. McAllester. Automatic Recognition of Tractability in Inference Relations. Journal of the ACM, 40(2), Apr. 1993.","DOI":"10.1145\/151261.151265"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"D. McAllester and R. Givan. Taxonomic Syntax for First-Order Inference. Journal of the ACM, 40(2), Apr. 1993.","DOI":"10.1145\/151261.151264"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"D. McAllester, R. Givan, D. Kozen, and C. Witty. Tarskian Set Constraints. In Proc. 11 th LICS. IEEE, 1996.","DOI":"10.1109\/LICS.1996.561313"},{"key":"28_CR23","unstructured":"M. M\u00fcller. Type Analysis for a Higher-Order Concurrent Constraint Language. Doctoral Dissertation. Universit\u00e4t des Saarlandes, Technische Fakult\u00e4t, 66041 Saarbr\u00fccken, Germany. In preparation."},{"key":"28_CR24","unstructured":"M. M\u00fcller, J. Niehren, and A. Podelski. Inclusion Constraints over Non-Empty Sets of Trees. Full version: http:\/\/www.ps.uni-sb.de\/Papers\/ines97.html."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"J. Niehren. Functional Computation as Concurrent Computation. In 23 rd POPL, pp. 333\u2013343. ACM, 1996.","DOI":"10.1145\/237721.237801"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"J. Niehren and M. M\u00fcller. Constraints for Free in Concurrent Computation. In Proc. 1 st ASIAN, LNCS 1023, pp. 171\u2013186. Springer, 1995.","DOI":"10.1007\/3-540-60688-2_43"},{"key":"28_CR27","unstructured":"The Oz Programming System. Programming Systems Lab, Universit\u00e4t des Saarlandes. Available at http:\/\/www.ps.uni-sb.de\/www\/oz\/."},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"V. A. Saraswat. Concurrent Constraint Programming. The MIT Press, 1993.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"G. Smolka. The Oz Programming Model. In J. van Leeuwen, ed., Computer Science Today, LNCS 1000, pp. 324\u2013343. Springer, 1995.","DOI":"10.1007\/BFb0015252"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:41:26Z","timestamp":1736127686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/bfb0030609","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}