Abstract
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models that accurately reflect the inherent structure of a problem, solvers that exploit the properties of this structure, and reformulation techniques that modify the problem encoding to reduce the cost of problem solving are typically used to overcome the complexity barrier. In this paper, we investigate such approaches in a geospatial reasoning task, the building-identification problem (BID), introduced and modeled as a Constraint Satisfaction Problem by Michalowski and Knoblock [1]. We introduce an improved constraint model, a custom solver for this problem, and a number of reformulation techniques that modify various aspects of the problem encoding to improve scalability. We show how interleaving these reformulations with the various stages of the solver allows us to solve much larger BID problems than was previously possible. Importantly, we describe the usefulness of our reformulations techniques for general Constraint Satisfaction Problems, beyond the BID application.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Michalowski, M., Knoblock, C.: A Constraint Satisfaction Approach to Geospatial Reasoning. In: AAAI 2005, pp. 423–429 (2005)
Pickering, T.: Speech by Under Secretary of State T. Pickering on 06/17/1999 to the Chinese Government Regarding the Accidental Bombing of the PRC Embassy in Belgrade (1999)
van Beek, P., Chen, X.: CPlan: A Constraint Programming Approach to Planning. In: AAAI 1999, pp. 585–590 (1999)
Kilby, P., Slaney, J., Thiébaux, S., Walsh, T.: Backbones and Backdoors in Satisfiability. In: AAAI 2005, pp. 1373–1468 (2005)
Choueiry, B.Y., Iwasaki, Y., McIlraith, S.: Towards a Practical Theory of Reformulation for Reasoning About Physical Systems. Artificial Intelligence 162 (1–2), 145–204 (2005)
Prosser, P.: MAC-CBJ: Maintaining Arc Consistency with Conflict-Directed Backjumping. Technical Report 95/177, Univ. of Strathclyde (1995)
Bessière, 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 – CP 1999. LNCS, vol. 1713, pp. 88–102. Springer, Heidelberg (1999)
Freuder, E., Elfe, C.: Neighborhood Inverse Consistency Preprocessing. In: AAAI 1996, pp. 202–208 (1996)
Dechter, R., van Beek, P.: Local and Global Relational Consistency. Journal of Theoretical Computer Science (1996)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (2003)
Giunchiglia, F., Walsh, T.: A Theory of Abstraction. Artificial Intelligence 57(2-3), 323–389 (1992)
Selman, B., Kautz, H.: Knowledge Compilation and Theory Approximation. Journal of the ACM 43(2), 193–224 (1996)
Milano, M. (ed.): Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic Publishers, Dordrecht (2004)
Gallai, T.: Über extreme Punkt- und Kantenmengen. Ann. Univ. Sci. Budapest, Eotvos Sect. Math. 2, 133–139 (1959)
Hopcroft, J., Karp, R.: An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM 2, 225–231 (1973)
Régin, J.: A Filtering Algorithm for Constraints of Difference in CSPs. In: AAAI 1994, pp. 362–367 (1994)
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. 1350, pp. 92–101. Springer, Heidelberg (1997)
Berge, C.: Graphs and Hypergraphs. American Elsevier, New York (1973)
Nadel, B.: Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens. IEEE Expert 5(3), 16–24 (1990)
Glaisher, J.: On the Problem of the Eight Queens. Philosophical Magazine 4(48), 457–467 (1874)
Holte, R.C., Choueiry, B.Y.: Abstraction and Reformulation in Artificial Intelligence. Philosophical Trans. of the Royal Society Sect. Biological Sciences 358(1435), 1197–1204 (2003)
Razgon, I., O’Sullivan, B., Provan, G.: Generalizing Global Constraints Based on Network Flows. In: Workshop on Constraint Modelling and Reformulation, pp. 74–87 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bayer, K.M., Michalowski, M., Choueiry, B.Y., Knoblock, C.A. (2007). Reformulating CSPs for Scalability with Application to Geospatial Reasoning. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)