Author:
Barták Roman,Salido Miguel A.,Rossi Francesca
Abstract
AbstractDuring recent years, the development of new techniques for constraint satisfaction, planning, and scheduling has received increased attention, and substantial effort has been invested in trying to exploit such techniques to find solutions to real-life problems. In this paper, we present a survey on constraint satisfaction, planning, and scheduling from the Artificial Intelligence point of view. In particular, we present the main definitions and techniques, and discuss possible ways of integrating such techniques. We also analyze the role of constraint satisfaction in planning and scheduling, and hint at some open research issues related to planning, scheduling, and constraint satisfaction.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Software
Reference88 articles.
1. Understanding line drawings of scenes with shadows;Waltz;The Psychology of Computer Vision,1975
2. Handling contingency in temporal constraint networks: from consistency to controllabilities
3. Learning solution preferences in constraint problems
4. Hybrid solving for CSP;Sadeh;ALP newsletter,2003
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献