- -

Constraint Satisfaction for Planning and Scheduling Problems

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Constraint Satisfaction for Planning and Scheduling Problems

Show full item record

Bartak, R.; Salido, MA. (2011). Constraint Satisfaction for Planning and Scheduling Problems. Constraints. 16(3):223-227. doi:10.1007/s10601-011-9109-4

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/69066

Files in this item

Item Metadata

Title: Constraint Satisfaction for Planning and Scheduling Problems
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
The areas of planning and scheduling (from the Artificial Intelligence point of view) have seen important advances thanks to application of constraint satisfaction techniques. Currently, many important real-world problems ...[+]
Subjects: Constraint programming , Planning , Scheduling , Search , Complex problems , Constraint handling , Constraint Satisfaction , Constraint satisfaction techniques , Extended versions , Plan synthesis , Planning and scheduling , Real-world problem , Satisfaction problem , State-dependent , Artificial intelligence , Computer programming , Constraint theory , Resource allocation
Copyrigths: Cerrado
Source:
Constraints. (issn: 1383-7133 ) (eissn: 1572-9354 )
DOI: 10.1007/s10601-011-9109-4
Publisher:
Springer Verlag (Germany)
Publisher version: http://dx.doi.org/10.1007/s10601-011-9109-4
Type: Artículo

References

Barber, F., & Salido, M. A. (2011). Robustness, stability, recoverability and reliability in dynamic constraint satisfaction problems. Technical report, DSIC-IA-PS-10251/10705, Spain. http://riunet.upv.es/bitstream/handle/10251/10705/IA-PS-2011-01.pdf .

Barták, R. (2003). Dynamic global constraints in backtracking based environments. Annals of Operations Research (Kluwer), 118, 101–119.

Dechter, R. (2003). Constraint processing. San Mateo: Morgan Kaufmann. [+]
Barber, F., & Salido, M. A. (2011). Robustness, stability, recoverability and reliability in dynamic constraint satisfaction problems. Technical report, DSIC-IA-PS-10251/10705, Spain. http://riunet.upv.es/bitstream/handle/10251/10705/IA-PS-2011-01.pdf .

Barták, R. (2003). Dynamic global constraints in backtracking based environments. Annals of Operations Research (Kluwer), 118, 101–119.

Dechter, R. (2003). Constraint processing. San Mateo: Morgan Kaufmann.

Ghallab, M., Nau, D., & Traverso, P. (2004). Automated planning. Theory and practice. San Mateo: Morgan Kaufmann.

Laborie, P., & Rogerie, J. (2008). Reasoning with conditional time-intervals. In Proceedings of the twenty-first international FLAIRS conference (pp. 555–560).

Mackworth, A. K. (1977). Consistency in network of relations. Artificial Intelligence, 8, 99–118.

Salido, M. A., & Barber, F. (2006). Distributed CSPs by graph partitioning. Applied Mathematics and Computation (Elsevier), 183, 491–498.

[-]

This item appears in the following Collection(s)

Show full item record