Review:

  • Authors:
  • Roman Bartá/k;Miguel a. Salido;Francesca Rossi

  • Affiliations:
  • Faculty of mathematics and physics, charles university in prague, malostranské/ ná/m. 2/25, 118 00 praha 1, czech republic/ e-mail: bartak@ktiml.mff.cuni.cz;Instituto de automá/tica e informá/tica industrial, universidad polité/cnica de valencia, camino de vera s/n 46020, valencia, spain/ e-mail: msalido@dsic.upv.es;Dipartimento di matematica pura ed applicata, universitá/ di padova, via trieste 63, 35121 padova, italy/ e-mail: frossi@math.unipd.it

  • Venue:
  • The Knowledge Engineering Review
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

During 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.