Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Planning for Security Management
IEEE Intelligent Systems
Least Commitment on Variable Binding in Presence of Incomplete Knowledge
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning and knowledge representation for softbots
Planning and knowledge representation for softbots
Constraint propagation and value acquisition: why we should do it interactively
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
In this paper, we present an architecture for planning and executing in complex and dynamic environments. Such application domains are characterized by large amount of data, too wide and dynamic to be completely stored and maintained up-to-date. Planning and execution activities should deal with unpredictable action effects, unknown knowledge and dynamic information. We propose to use a planner and an executor based on the Interactive Constraint Satisfaction framework combining both search efficiency and data acquisition ability. Both planning and execution can be seen as search processes where constraint propagation, data acquisition and search are interleaved.