Skip to main content
Have a personal or library account? Click to login
A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems Cover

A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems

Open Access
|Dec 2011

References

  1. Arangú, M., Salido, M. A. and Barber, F. (2010). AC2001-OP: An arc-consistency algorithm for constraint satisfaction problems,, pp. 219-228.
  2. Barták, R. (1999). Constraint programming: In pursuit of the Holy Grail,, Part IV, pp. 555-561.
  3. Barták, R. (2001). Theory and practice of constraint propagation,, pp. 7-14.
  4. Barták, R. (2005). Constraint propagation and backtracking-based search,, pp. 1-43.
  5. Barták, R., Salido, M. A. and Rossi, F. (2010). Constraint satisfaction techniques in planning and scheduling,: 5-15.
  6. Bessiere, C. (1994). Arc-consistency and arc-consistency again,: 179-190.
  7. Bessiere, C. (2006). Constraint propagation,, CNRS/University of Montpellier, Montpellier.
  8. Bessiere, C. and Cordier, M. (1993). Arc-consistency and arc-consistency again,, pp. 108-113.
  9. Bessiere, C., Freuder, E. and Régin, J. C. (1999). Using constraint metaknowledge to reduce arc consistency computation,: 125-148.
  10. Bessiere, C., Régin, J. C., Yap, R. and Zhang, Y. (2005). An optimal coarse-grained arc-consistency algorithm,: 165-185.
  11. Brdyś, M. A. and Littler, J. J. (2002). Fuzzy logic gain scheduling for non-linear servo tracking,(2): 209-219.
  12. Chmeiss, A. and Jegou, P. (1998). Efficient path-consistency propagation,: 121-142.
  13. Dechter, R. (2003)., Morgan Kaufmann, San Francisco, CA.
  14. Deng, J., Becerra, V. M. and Stobart, R. (2009). Input constraints handling in an MPC/feedback linearization scheme,(2): 219-232, DOI: 10.2478/v10006-009-0018-2.
  15. Hentenryck, P. V., Deville, Y. and Teng, C. M. (1992). A generic arc-consistency algorithm and its specializations,: 291-321.
  16. Królikowski, A. and Jerzy, D. (2001). Self-tuning generalized predictive control with input constraints,(2): 459-479.
  17. Mackworth, A. K. (1977). Consistency in networks of relations,: 99-118.
  18. Mehta, D. (2008). Reducing checks and revisions in the coarsegrained arc consistency algorithms,: 37-53.
  19. Mesghouni, K., Hammadi, S. and Borne, P. (2004). Evolutionary algorithms for job-shop scheduling,(1): 91-103.
  20. Mohr, R. and Henderson, T. (1986). Arc and path consistency revised,: 225-233.
  21. Perlin, M. (1992). Arc consistency for factorable relations,: 329-342.
  22. Rossi, F., Van Beek, P. and Walsh, T. (2008)., Elsevier Science and Technology, Amsterdam.
  23. Ruttkay, Z. (1998). Constraint satisfaction—A survey,(2&3): 123-162.
  24. Sikora, B. (2003). On the constrained controllability of dynamical systems with multiple delays in the state,(4): 469-479.
  25. Tsang, E. (1995)., Academic Press, London/San Diego, CA.
  26. van Dongen, M., Dieker, A. and Sapozhnikov, A. (2008). The expected value and the variance of the checks required by revision algorithms,: 55-77.
DOI: https://doi.org/10.2478/v10006-011-0058-2 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 733 - 744
Published on: Dec 21, 2011
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2011 Marlene Arangú, Miguel Salido, published by University of Zielona Góra
This work is licensed under the Creative Commons License.