Nineteenth International Joint Conference on Artificial Intelligence

Submission guidelines           Main Contact            IJCAI Home

Sixth International Workshop on


Final program


Distributed Constraint Reasoning (DCR) problems arise when pieces of information about variables, constraints or both are relevant to independent but communicating agents. They provide a promising framework to deal with the increasingly diverse range of distributed real world problems emerging from the evolution of computation and communication technologies.

Distributed constraints satisfaction problems (DisCSPs) have been studied for over a decade. Due to the distributed nature of the problem, new algorithmic techniques as well as concurrent measures of performance have been developed. The current challenges posed by solving Distributed Constraint Reasoning Problems include designing new distributed search algorithms for DisCSPs and Distributed Constraint Optimization (DisCOP), resource restrictions (such as limits on time and communication), privacy requirements, and exploring real world distributed applications for DCR.

The goal of the DCR workshop series is to bring together researchers from the many different areas that are relevant to distributed constraint reasoning so that commonalities and relationships can be discovered and understanding improved. As such, this workshop has historically rotated its location between the three major conferences in each of these areas: CP (2000, 2004), IJCAI (2001, 2003) and AAMAS (2002). Building upon these previous successful workshops, we continue in 2005, with the Sixth International DCR workshop held in conjunction with IJCAI 2005 in Edinburgh.

Papers (download the entire proceedings in pdf)

The proceedings include 16 papers that are divided into four areas:

Each of these areas has 4 or 5 papers that will be presented in a separate panel and are grouped together in the proceedings. The first two papers in every panel are longer presentations and the last 2-3 are shorter. Two panels are planned in the morning and two in the afternoon. The panel on Applications of DisCSPs has also an invited speaker and the extended abstract of the talk is in that section of the proceedings. The Schedule of the workshop includes links to the abstracts of all papers. The overall harvest of papers is very impressive for this young a field and I am grateful to all of the authors and especially to the organizing and program committee, for working hard to make this an interesting and fruitful workshop. Finally, a special personal thank you to Roie Zivan and Mayer Goldberg for their help in organizing and putting together the proceedings.

Amnon Meisels (Workshop chair)

Program Committee


Morning sessions
Search algorithms on DisCSPs (9:00 - 10:30) Coffee Break

Applications of DisCSPs (11:00 - 12:00) Invited talk (12:00 - 12:45)
Space Applications for Distributed Constraint Reasoning
B. J. Clement and A. C. Barrett  abstract  pdf

Afternoon sessions

Privacy and Security (14:00 - 15:00) Coffee Break

Privacy and Security (continued session) (15:30 - 16:00) Distributed Optimization (16:00 - 17:15)