1. Kim Marriott and P. J. Stuckey. Programming with constraints : an introduction. MIT Press, Cambridge, Mass., 1998.
   Note: 97040549 Kim Marriott and Peter J. Stuckey. Includes bibliographical references and index. 1. Constraints -- 2. Simplification, Optimization and Implication -- 3. Finite Constraint Domains -- 4. Constraint Logic Programs -- 5. Simple Modelling -- 6. Using Data Structures -- 7. Controlling Search -- 8. Modelling with Finite Domain Constraints -- 9. Advanced Programming Techniques -- 10. CLP Systems -- 11. Constraint Databases -- 12. Other Constraint Programming Languages.
   Keywords: logic programming, constraint satisfaction, graph theory, honours reading. [bibtex-entry]

1. Ramon Bejar, Carmel Domshlak, Cèsar Fernandez, Carla Gomes, Bhaskar Krishnamachari, Bart Selman, and Magda Valls. Sensor networks and distributed CSP: communication, computation and complexity. Artificial Intelligence, 161(1-2):117--147, 2005.
   Keywords: algorithms, honours reading, constraint satisfaction, sensor networks. [bibtex-entry]



2. Peter Hawkins, Vitaly Lagoon, and Peter J. Stuckey. Solving Set Constraint Satisfaction Problems using ROBDDs. Journal of Artificial Intelligence Research (JAIR), 24:109--156, 2005.
   Keywords: constraint satisfaction, honours reading. [bibtex-entry]



3. P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149--180, 2005.
   Keywords: algorithms, honours reading, constraint satisfaction, DCOP, DCSP. [bibtex-entry]



4. W. de Vries, F. S. de Boer, K. Hindriks, W. van der Hoek, and J. J. C. Meyer. A programming language for coordinating group actions. In From Theory to Practice in Multi-Agent Systems, volume 2296 of Lecture Notes in Artificial Intelligence, pages 313--321. 2002.
   Keywords: agent programming languages, multiagent coordination, graph theory, constraint satisfaction, honours reading. [abstract] [download paper ] [bibtex-entry]



5. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, vol.124, no.2:243--282, 2000.
   Keywords: agent programming languages, multiagent coordination, graph theory, constraint satisfaction, honours reading, DCOP, DCSP. [abstract] [bibtex-entry]



6. Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.
   Keywords: algorithms, honours reading, constraint satisfaction, logistics. [bibtex-entry]



7. Ilkka Niemela. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence, 25(3):241--273, 1999.
   Keywords: logic programming, nonmonotonic logic, constraint satisfaction, honours reading. [bibtex-entry]

1. Duc Nghia Pham, John Thornton, and Abdul Sattar. Building structure into local search for SAT. In International Joint Conference on Artificial Intelligence, Hyderabad, pages 2359--2364, 2007.
   Keywords: Constraint satisfaction, DCSP, DCOP, honours reading. [bibtex-entry]



2. Terence H. -W. Law and Adrian R. Pearce. A Multi-stage graph decomposition algorithm for distributed constraint optimisation. In Silvia Ceballos, editor, IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-06), Hong Kong, pages 506--511, 2006. IEEE Computer Society Press.
   Keywords: agentlab, agent programming languages, honours reading, constraint satisfaction, DCOP, DCSP. [download paper ] [bibtex-entry]



3. Roger Mailler. Comparing Two Approaches to Dynamic, Distributed Constraint Satisfaction. In Autonomous Agents and Multiagents Systems (AAMAS2005), Utrect, Netherlands, pages 1049--1056, 2005. ACM.
   Keywords: constraint satisfaction, multiagent coordination, honours reading. [bibtex-entry]



4. Pragnesh Jay Modi. Impact of Problem Centralization in Distributed Constraint Optimization Algorithms. In Autonomous Agents and Multiagent Systems (AAMAS2005), Utrect, Netherlands, pages 1057--1063, 2005. ACM.
   Keywords: constraint satisfaction, multiagent coordination, honours reading, DCOP, DCSP. [bibtex-entry]



5. Pragnesh Jay Modi, Shen Wei-Min, and Milind Tambe. An Asynchronous Complete method for distributed constraint optimization. In Jeffrey S. Rosenschein, Tuomas Sandholm, Michael Wooldridge, and Makoto Yokoo, editors, AAMAS-2003, Melbourne, pages 161--176, 2003.
   Keywords: constraint satisfaction, computational complexity, algorithms, DCOP, DCSP. [abstract] [bibtex-entry]



6. Gadi Solotorevsky and Ehud Gudes. Algorithms for solving distributed constraint satisfaction problems (DCSPs). In Brian Drabble, editor, Artificial Intelligence Planning Systems Conference (AIP), Edinburgh, pages 191--198, 1996. AAAI Press.
   Keywords: multiagent coordination, honours reading, DCOP, DCSP, constraint satisfaction. [abstract] [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.