{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:52Z","timestamp":1740096052039,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713883"},{"type":"electronic","value":"9783540713890"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71389-0_19","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:22:53Z","timestamp":1183321373000},"page":"258-273","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Constraints for Sets with Cardinality Bounds"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Marnette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor","family":"Kuncak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Rinard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0049320","volume-title":"Computer Science Logic","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., et al.: The complexity of set constraints. In: Meinke, K., B\u00f6rger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol.\u00a0832, Springer, Heidelberg (1994)"},{"key":"19_CR2","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ envelope. In: Proc. 19th Int. Joint Conf. on Artificial Intelligence IJCAI-05 (2005)"},{"volume-title":"The Description Logic Handbook: Theory, Implementation and Applications","year":"2003","key":"19_CR3","unstructured":"Baader, F., et al. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H., Waldmann, U.: Set constraints are the monadic class. In: Logic in Computer Science, pp. 75\u201383 (1993)","DOI":"10.1109\/LICS.1993.287598"},{"key":"19_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3452-2","volume-title":"Set Theory for Computing","author":"D. Cantone","year":"2001","unstructured":"Cantone, D., Omodeo, E., Policriti, A.: Set Theory for Computing. Springer, Heidelberg (2001)"},{"key":"19_CR6","first-page":"257","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. ITA\u00a026, 257\u2013286 (1992)","journal-title":"ITA"},{"key":"19_CR7","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F.M. Donini","year":"1997","unstructured":"Donini, F.M., et al.: The complexity of concept languages. Information and Computation\u00a0134(1), 1\u201358 (1997)","journal-title":"Information and Computation"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/514952.514955","volume":"24","author":"S. Drossopoulou","year":"2002","unstructured":"Drossopoulou, S., et al.: More Dynamic Object Re-classification: FickleII. ACM Trans. Programming Languages and Systems\u00a024(2), 153\u2013191 (2002)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","volume":"47","author":"S. Feferman","year":"1959","unstructured":"Feferman, S., Vaught, R.L.: The first order properties of products of algebraic systems. Fundamenta Mathematicae\u00a047, 57\u2013103 (1959)","journal-title":"Fundamenta Mathematicae"},{"key":"19_CR11","volume-title":"UML Distilled","author":"M. Fowler","year":"2000","unstructured":"Fowler, M.: UML Distilled, 2nd edn. Addison-Wesley, Reading (2000)","edition":"2"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/566385.566387","volume":"3","author":"R. Givan","year":"2002","unstructured":"Givan, R., Mcallester, D.: Polynomial-time computation via local inference relations. ACM Trans. Comput. Logic\u00a03(4), 521\u2013541 (2002)","journal-title":"ACM Trans. Comput. Logic"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/BFb0035836","volume-title":"STACS 88","author":"E. Gr\u00e4del","year":"1988","unstructured":"Gr\u00e4del, E.: Domino games with an application to the complexity of boolean algebras with bounded quantifier alternations. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol.\u00a0294, pp. 98\u2013107. Springer, Heidelberg (1988)"},{"key":"19_CR14","volume-title":"Software Abstractions: Logic, Language, & Analysis","author":"D. Jackson","year":"2006","unstructured":"Jackson, D.: Software Abstractions: Logic, Language, & Analysis. MIT Press, Cambridge (2006)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(80)90048-1","volume":"10","author":"D. Kozen","year":"1980","unstructured":"Kozen, D.: Complexity of boolean algebras. Theoretical Computer Science\u00a010, 221\u2013247 (1980)","journal-title":"Theoretical Computer Science"},{"key":"19_CR16","unstructured":"Kuncak, V.: Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology (February 2007)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Kuncak, V., Lam, P., Rinard, M.: Role analysis. In: Annual ACM Symp. on Principles of Programming Languages (POPL) (2002)","DOI":"10.1145\/503272.503276"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning (2006), http:\/\/dx.doi.org\/10.1007\/s10817-006-9042-1","DOI":"10.1007\/s10817-006-9042-1"},{"key":"19_CR19","unstructured":"Kuncak, V., Rinard, M.: The first-order theory of sets with cardinality constraints is decidable. Technical Report 958, MIT CSAIL (July 2004)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/978-3-540-30579-8_28","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Lam","year":"2005","unstructured":"Lam, P., Kuncak, V., Rinard, M.: Generalized Typestate Checking for Data Structure Consistency. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 430\u2013447. Springer, Heidelberg (2005)"},{"key":"19_CR21","first-page":"228","volume":"76","author":"L. Loewenheim","year":"1915","unstructured":"Loewenheim, L.: \u00dcber M\u00f6gligkeiten im Relativkalk\u00fcl. Math. Annalen\u00a076, 228\u2013251 (1915)","journal-title":"Math. Annalen"},{"key":"19_CR22","unstructured":"Marnette, B., Kuncak, V., Rinard, M.: On algorithms and complexity for sets with cardinality constraints. Technical report, MIT CSAIL (August 2005)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45789-5_5","volume-title":"Static Analysis","author":"H. Riis Nielson","year":"2002","unstructured":"Riis Nielson, H., Nielson, F., Seidl, H.: Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 20\u201335. Springer, Heidelberg (2002)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Databases and Information Systems","author":"P. Revesz","year":"2004","unstructured":"Revesz, P.: Quantifier-elimination for the first-order theory of boolean algebras with linear cardinality constraints. In: Bencz\u00far, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol.\u00a03255, Springer, Heidelberg (2004)"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"19_CR26","unstructured":"Schmolze, J.G., Lipkis, T.A.: Classification in the KL-ONE knowledge representation system. In: IJCAI, pp. 330\u2013332 (1983)"},{"key":"19_CR27","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB, pp. 82\u201394 (1981)"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Zarba, C.G.: Combining sets with cardinals. J. of Automated Reasoning\u00a034(1) (2005)","DOI":"10.1007\/s10817-005-3075-8"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T01:57:39Z","timestamp":1737165459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540713883","9783540713890"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}