Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
CPlan: a constraint programming approach to planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens
IEEE Expert: Intelligent Systems and Their Applications
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Constraint Processing
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
Graphs and Hypergraphs
A constraint satisfaction approach to geospatial reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Towards a practical theory of reformulation for reasoning about physical systems
Artificial Intelligence - Special volume on reformulation
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Exploiting automatically inferred constraint-models for building identification in satellite imagery
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Hi-index | 0.00 |
While many real-world combinatorial problems can be advantageously modeled and solved usingConstraint 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.