{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:52Z","timestamp":1725490192140},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735793"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73580-9_8","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T05:52:00Z","timestamp":1187848320000},"page":"64-79","source":"Crossref","is-referenced-by-count":3,"title":["Reformulating Constraint Satisfaction Problems to Improve Scalability"],"prefix":"10.1007","author":[{"given":"Kenneth M.","family":"Bayer","sequence":"first","affiliation":[]},{"given":"Martin","family":"Michalowski","sequence":"additional","affiliation":[]},{"given":"Berthe Y.","family":"Choueiry","sequence":"additional","affiliation":[]},{"given":"Craig A.","family":"Knoblock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Michalowski, M., Knoblock, C.: A Constraint Satisfaction Approach to Geospatial Reasoning. In: Proc. of AAAI 2005, pp. 423\u2013429 (2005)"},{"issue":"1\u20132","key":"8_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.artint.2004.01.004","volume":"162","author":"B.Y. Choueiry","year":"2005","unstructured":"Choueiry, B.Y., Iwasaki, Y., McIlraith, S.: Towards a Practical Theory of Reformulation for Reasoning About Physical Systems. Artificial Intelligence\u00a0162 (1\u20132), 145\u2013204 (2005)","journal-title":"Artificial Intelligence"},{"issue":"2-3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","volume":"57","author":"F. Giunchiglia","year":"1992","unstructured":"Giunchiglia, F., Walsh, T.: A Theory of Abstraction. Artificial Intelligence\u00a057(2-3), 323\u2013389 (1992)","journal-title":"Artificial Intelligence"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Dechter, R., van Beek, P.: Local and global relational consistency. Journal of Theoretical Computer Science (1996)","DOI":"10.1016\/S0304-3975(97)86737-0"},{"key":"8_CR5","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"8_CR6","first-page":"107","volume-title":"Artificial Intelligence: A Modern Approach","author":"S. Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. In: Artificial Intelligence: A Modern Approach, p. 107. Prentice-Hall, Englewood Cliffs (2003)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/226643.226644","volume":"43","author":"B. Selman","year":"1996","unstructured":"Selman, B., Kautz, H.: Knowledge Compilation and Theory Approximation. Journal of the ACM\u00a043(2), 193\u2013224 (1996)","journal-title":"Journal of the ACM"},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8917-8","volume-title":"Constraint and Integer Programming: Toward a Unified Methodology","author":"M. Milano","year":"2004","unstructured":"Milano, M.: Constraint and Integer Programming: Toward a Unified Methodology. Kluwer, Dordrecht (2004)"},{"key":"8_CR9","unstructured":"Ellman, T.: Abstraction via Approximate Symmetry. In: IJCAI 1993, pp. 916\u2013921 (1993)"},{"key":"8_CR10","unstructured":"R\u00e9gin, J.: A filtering algorithm for constraints of difference in csps. In: AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-63890-3_11","volume-title":"Algorithms and Computation","author":"T. Uno","year":"1997","unstructured":"Uno, T.: Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 92\u2013101. Springer, Heidelberg (1997)"},{"key":"8_CR12","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. Elsevier, Amsterdam (1973)"},{"key":"8_CR13","volume-title":"Introduction to Graph Theory","author":"D. West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)","edition":"2"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM\u00a02, 225\u2013231 (1973)","journal-title":"SIAM"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-540-48085-3_7","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"C. Bessi\u00e8re","year":"1999","unstructured":"Bessi\u00e8re, C., Meseguer, P., Freuder, E., Larrosa, J.: On Forward Checking for Non-binary Constraint Satisfaction. In: Jaffar, J. (ed.) Principles and Practice of Constraint Programming \u2013 CP 1999. LNCS, vol.\u00a01713, pp. 88\u2013102. Springer, Heidelberg (1999)"},{"key":"8_CR16","unstructured":"Prosser, P.: MAC-CBJ: Maintaining Arc Consistency with Conflict-Directed Backjumping. Technical Report 95\/177, Univ. of Strathclyde (1995)"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/64.54670","volume":"5","author":"B. Nadel","year":"1990","unstructured":"Nadel, B.: Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens. IEEE Expert\u00a05(3), 16\u201324 (1990)","journal-title":"IEEE Expert"},{"issue":"48","key":"8_CR18","first-page":"457","volume":"4","author":"J. Glaisher","year":"1874","unstructured":"Glaisher, J.: On the Problem of the Eight Queens. Philosophical Magazine\u00a04(48), 457\u2013467 (1874)","journal-title":"Philosophical Magazine"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-56804-2_33","volume-title":"Methodologies for Intelligent Systems","author":"J. Puget","year":"1993","unstructured":"Puget, J.: On the satisfiability of symmetrical constraint satisfaction problems. In: Komorowski, J., Ra\u015b, Z.W. (eds.) ISMIS 1993. LNCS, vol.\u00a0689, pp. 350\u2013361. Springer, Heidelberg (1993)"},{"issue":"1435","key":"8_CR20","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1098\/rstb.2003.1317","volume":"358","author":"R.C. Holte","year":"2003","unstructured":"Holte, R.C., Choueiry, B.Y.: Abstraction and Reformulation in Artificial Intelligence. Philosophical Trans. of the Royal Society Sec. Biological Sciences\u00a0358(1435), 1197\u20131204 (2003)","journal-title":"Philosophical Trans. of the Royal Society Sec. Biological Sciences"},{"key":"8_CR21","unstructured":"Razgon, I., O\u2019Sullivan, B., Provan, G.: Generalizing Global Constraints Based on Network Flows. In: Workshop on Constraint Modelling and Reformulation, pp. 74\u201387 (2006)"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73580-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:52:34Z","timestamp":1619517154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73580-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735793"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73580-9_8","relation":{},"subject":[]}}