Christian Bessière,
Pedro Meseguer,
Eugene C. Freuder,
& Javier Larrosa
(2002).On foward checking for non-binary constraint satisfaction.Artificial Intelligence, 141, 205-224.[BibTeX]
Pedro Meseguer,
Martí Sánchez,
& Gérard Verfaillie
(2002).Opportunistic Specialization in Russian Doll Search.Pascal Van Hentenryck (Eds.),Lecture Notes in Computer Science(pp. 264-279).
Springer-Verlag.[BibTeX]
Javier Larrosa,
& Pedro Meseguer
(2002).Partition-Based Lower Bound for Max-CSP.Constraints Journal, 7, 407-419.[BibTeX]
Javier Larrosa,
Pedro Meseguer,
& Martí Sánchez
(2002).Pseudo-Tree Search with Soft Constraints.F. Harmelen (Eds.),Proceedings of the 15th European Conference on Artificial Intelligence, ECAI-02(pp. 131-135).
IOS Press.[BibTeX]
2001
Christian Bessière,
Arnold Maestre,
& Pedro Meseguer
(2001).Distributed Dynamic Backtracking.Marius-Calin Silaghi (Eds.),Proceedings of the IJCAI'01. Workshop on Distributed Constraint Reasoning(pp. 9-16).
[BibTeX]
Christian Bessière,
Arnold Maestre,
& Pedro Meseguer
(2001).Dynamic Backtracking distribué.Proceedings Journées nationales sur la résolution pratique de problèmes NP-Complets, JNPC'2001(pp. 61-72).
[BibTeX]
Pedro Meseguer,
& Carme Torras
(2001).Exploiting symmetries within constraint satisfaction search.Artificial Intelligence, 129, 133-163.[BibTeX]