Constraint propagation with interval labels
Artificial Intelligence
SOAR: an architecture for general intelligence
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty
ACM Computing Surveys (CSUR)
Computer design of equipment layouts using the design problem solver (dps)
Computer design of equipment layouts using the design problem solver (dps)
Measuring the expected gain of communicating constraint information
Multiagent and Grid Systems - Planning in multiagent systems
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Beyond contention: extending texture-based scheduling heuristics
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Texture-based heuristics for scheduling revisited
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Hi-index | 0.00 |
We propose a model of problem solving that provides both structure and focus to search. The model achieves this by combining constraint satisfaction with heuristic search. We introduce the concepts of topology and texture to characterize problem structure and areas to focus attention respectively. The resulting model reduces search complexity and provides a more principled explanation of the nature and power of heuristics in problem solving. We demonstrate the model of Constrained Heuristic Search in two domains: spatial planning and factory scheduling. In the former we demonstrate significant reductions in search.