Bibliography

1

Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
Search Space Extraction.
In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, Lisbon, Portugal, 2009. Springer.

2

David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
A Soft Global Precedence Constraint.
In Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09), Pasadena, CA, USA, 2009.

3

David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
Consistency techniques for finding an optimal relaxation of a feature subscription.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence, 2008.

4

David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
Solving a Telecommunications Feature Subscription Configuration Problem.
In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming, Sydney, Australia, 2008. Springer.

5

Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
A BDD approach to the feature subscription problem.
In Proceedings of Prestigous Applications of Intelligent Systems (PAIS) 2008, 2008.

6

David Lesaint, John Ly, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
A personalisable internet telephony service.
In ECAI 2008 Systems Demonstration, 2008.

7

David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson.
Personalisation of telecommunications services as combinatorial optimisation.
In Proceedings of Innovative Applications of Artificial Intelligence (IAAI) 2008, 2008.

8

Luis Quesada.
Solving Constrained Graph Problems using Reachability Constraints based on Transitive Closure and Dominators.
Doctoral dissertation, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2006.

9

F. Spiessens, L. Quesada, and P. Van Roy.
Confinement analysis with graph reachabilty constraints.
In International Workshop on Constraints in Software Testing, Verification and Analysis (CSTVA06), at the 12th International Conference on Principles and Practice of Constraint Programming (CP2006), 2006.

10

Luis Quesada, Peter Van Roy, Yves Deville, and Raphaël Collet.
Using dominators for solving constrained path problems.
In PADL 2006 Proceedings, Lecture Notes in Computer Science. Springer, 2006.

11

Luis Quesada, Peter Van Roy, and Yves Deville.
Speeding up constrained path solvers with a reachability propagator.
In Colloquium on Implementation of Constraint and Logic Programming Systems(CICLOPS 2005), at the 11th International Conference on Principles and Practice of Constraint Programming (CP2005), 2005.

12

Luis Quesada, Peter Van Roy, and Yves Deville.
Speeding up constrained path solvers with a reachability propagator (abstract).
In CP 2005 Proceedings, Lecture Notes in Computer Science. Springer, 2005.

13

Luis Quesada, Peter Van Roy, and Yves Deville.
Reachability: a constrained path propagator implemented as a multi-agent system.
In CLEI2005 Proceedings, 2005.

14

Luis Quesada, Peter Van Roy, and Yves Deville.
The reachability propagator.
Research Report INFO-2005-07, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2005.

15

Luis Quesada, Peter Van Roy, and Yves Deville.
Solving constrained path problems in non-monotonic environments.
Research Report INFO-2004-03, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2004.

16

L. Quesada, S. Gualandi, and P. Van Roy.
Implementing a distributed shortest path propagator with message passing.
In 2nd International Workshop on Multiparadigm Constraint Programming Languages (MultiCPL 2003), at the 9th International Conference on Principles and Practice of Constraint Programming (CP2003), 2003.

17

L. Quesada and P. Van Roy.
A concurrent constraint programming approach for trajectory determination of autonomous vehicles (abstract).
In CP 2002 Proceedings, Lecture Notes in Computer Science. Springer, 2002.

18

J. Diaz, L. Quesada, C. Rueda, C. Garcia, and S. Cetina.
Pathos: Object-oriented concurrent constraint timetabling for real world cases.
In CLEI 2002 Proceedings, 2002.

19

L. Quesada and C. Rueda.
Planeamiento horario universitario orientado-objetos en programación concurrente por restricciones.
Epiciclos, 1(1):103-116, 2002.

20

C. Rueda, G. Alvarez, L. Quesada, G. Tamura, F. Valencia, J. Diaz, and G. Assayag.
Integrating constraint and concurrent objects in musical applications: A calculus and its visual language.
Constraints "An Intenational Journal", 6(1), January 2001.

21

G. Alvarez, J. Diaz, L. Quesada, F. Valencia, G. Assayag, and C. Rueda.
Pico: A calculus of concurrent constraint objects for musical applications.
In ECAI98 Proceedings, 1998.

22

L. Quesada, C. Rueda, and G. Tamura.
The visual model of cordial.
In CLEI97 Proceedings, 1997.