Constrained Heuristic Search

Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has been demonstrated. In contrast, constraint programming often utilizes the same domain independent heuristics to find efficient solutions across a broad range of problems types. This paper provides a progress report on how a specific form of constraint-based reasoning, namely Constrained Heuristic Search (CHS) can be effectively introduced into an integrated symbolic cognitive architecture (Soar) to achieve domain independent learning. The integration of CHS into Soar retains the underlying problem-solving generality of Soar, yet exploits the generalized problem representation and solving techniques associated with constraint programming. Preliminary experiments are conducted on two problems types: Map Colouring and Job Shop Scheduling, both of which are used to demonstrate a domain independent learning using...

• Type: Conference
• Year: 1989
• Where: IJCAI
• Authors: Mark S. Fox, Norman M. Sadeh, Can A. Baykan
• Keywords: Cognitive Architecture, Constraint Programming, Domain Independent Learning, IJCAI 1989, IJCAI 2007