. Disproblem and . Disproblem, Hello DisChoco

. Yokoo, The algorithms currently implemented in DisChoco 2.0 are: ABT, straint network problem is expressed in the XDisCSP format, we can solve it using ABT-Hyb [ Brito and Meseguer AFC [ Meisels and Zivan AFC-tree [ Wahbi et al., 2012 ] , DBA [ Yokoo and Hirayama, 1995 ] and DisFC the class of DisCSPs with simple agents. In the class of DisCSPs where agents have local complex problems, ABT-cf [ Ezzahir et al., 2008b ] was implemented. For DCOPs, the algorithms that are implemented in DisChoco 2.0 are, 1992.

. Adopt and . Modi, For solving a problem, we can use a simple command line: The Graphical User Interface (GUI) of DisChoco allows to visualize the constraint graph. Hence, the user can analyses the structure of the problem to be solved. This also helps to debug the algorithms, 2005.

V. Bacchus and . Run, Fahiem Bacchus, and Paul Van Run Dynamic variable ordering in CSPs, Proceeding of the First International Conference on Principles and Practice of Constraint Programming, CP'95, pp.258-275, 1995.

. Beck, Trying Again to Fail-First, Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints, CSCLP'04, pp.41-55, 2005.
DOI : 10.1007/11402763_4

. Béjar, Sensor networks and distributed CSP: communication, computation and complexity, Artificial Intelligence, vol.161, issue.1-2, pp.117-147, 2005.
DOI : 10.1016/j.artint.2004.09.002

C. Bessiere, M. Bessiere, and . Cordier, Arcconsistency and arc-consistency again, Proceedings of the eleventh national conference on Artificial intelligence, AAAI'93, pp.108-113, 1993.

R. Bessiere, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, CP'96, pp.61-75, 1996.
DOI : 10.1007/3-540-61551-2_66

R. Bessiere, J. Bessiere, and . Régin, Refining the basic constraint propagation algorithm, Proceedings of the 17th international joint conference on Artificial intelligence -Volume 1, IJCAI'01, pp.309-315, 2001.

. Bessiere, Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence, vol.107, issue.1, pp.125-148, 1999.
DOI : 10.1016/S0004-3702(98)00105-2

. Bessiere, Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem, Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP'01, pp.565-569, 2001.
DOI : 10.1007/3-540-45578-7_40

. Bessiere, Distributed Dynamic Backtracking, Proceeding of Workshop on Distributed Constraint Reasoning , IJCAI'01, 2001.
DOI : 10.1007/3-540-45578-7_73

URL : https://hal.archives-ouvertes.fr/lirmm-00329883

. Bessiere, Asynchronous backtracking without adding links: a new member in the ABT family, Artificial Intelligence, vol.161, issue.1-2, pp.7-24, 2005.
DOI : 10.1016/j.artint.2004.10.002

URL : https://hal.archives-ouvertes.fr/lirmm-00105347

. Bessiere, Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, pp.777-784, 2011.
DOI : 10.1109/ICTAI.2011.122

URL : https://hal.archives-ouvertes.fr/lirmm-00595688

. Boussemart, American Association for Artificial Intelligence Boosting Systematic Search by Weighting Constraints New methods to color the vertices of a graph, Proceedings of the fifteenth national AAAI'98/IAAI'98 Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'04, pp.319-325, 1979.

P. Meseguer, Distributed forward checking, Proceeding of 9th International Conference on Principles and Practice of Constraint Programming, CP'03, pp.801-806, 2003.

M. Brito, P. Brito, and . Meseguer, Connecting ABT with Arc Consistency, CP, pp.387-401, 2008.
DOI : 10.1007/978-3-540-85958-1_26

. Brito, Distributed constraint satisfaction with partially known constraints, Constraints, vol.46, issue.2, 3, pp.199-234, 2009.
DOI : 10.1007/s10601-008-9048-x

L. Chandy, L. Chandy, and . Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, vol.3, issue.1, pp.63-75, 1985.
DOI : 10.1145/214451.214456

S. Chechetka, K. Chechetka, and . Sycara, A decentralized variable ordering method for distributed constraint optimization, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems , AAMAS '05, 2005.
DOI : 10.1145/1082473.1082746

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1580

S. Chechetka, K. Chechetka, and . Sycara, No-commitment branch and bound search for distributed constraint optimization, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems , AAMAS '06, pp.1427-1429, 2006.
DOI : 10.1145/1160633.1160900

. Chinn, The bandwidth problem for graphs and matrices???a survey, Journal of Graph Theory, vol.17, issue.3, pp.223-254, 1982.
DOI : 10.1002/jgt.3190060302

H. Chong, Distributed logbased reconciliation, Proceedings of the 17th European Conference on Artificial Intelligence, ECAI'06, pp.108-112, 2006.

. Davis, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

D. Kleer, S. Kleer, and G. J. Sussman, Propagation of constraints applied to circuit synthesis, International Journal of Circuit Theory and Applications, vol.24, issue.2, pp.127-144, 1980.
DOI : 10.1002/cta.4490080206

F. Dechter, D. Dechter, and . Frost, Backjump-based backtracking for constraint satisfaction problems, Artificial Intelligence, vol.136, issue.2, pp.147-188, 2002.
DOI : 10.1016/S0004-3702(02)00120-0

URL : http://doi.org/10.1016/s0004-3702(02)00120-0

M. Dechter, I. Dechter, and . Meiri, Experimental evaluation of preprocessing techniques in constraint satisfaction problems, Proceedings of the 11th international joint conference on Artificial intelligence -Volume 1, IJCAI'89, pp.271-277, 1989.

P. Dechter, J. Dechter, and . Pearl, Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence, vol.34, issue.1, pp.1-38, 1988.
DOI : 10.1016/0004-3702(87)90002-6

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3

R. Dechter, Constraint networks (survey), Encyclopedia of Artificial Intelligence, vol.1, pp.276-285, 1992.

. Ezzahir, DisChoco: a platform for distributed constraint programming, Proceedings of the IJCAI'07 workshop on Distributed Constraint Reasoning, pp.16-21, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00189778

. Ezzahir, Dynamic backtracking for distributed constraint optimization, Proceeding of the 18th European Conference on Artificial Intelligence, ECAI'08, pp.901-902, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00329883

. Ezzahir, Asynchronous backtracking with compilation formulation for handling complex local problems, ICGST International Journal on Artificial Intelligence and Machine Learning, AIML, vol.8, pp.45-53, 2008.

. Ezzahir, Imade Benelallam, and El-Houssine Bouyakhf. Asynchronous inter-level forward-checking Bibliography for discsps, Proceedings of the 15th international conference on Principles and practice of constraint programming, CP'09, pp.304-318, 2009.

. Fox, Job-shop scheduling: An investigation in constraint-directed reasoning, Proceedings of the National Conference on Artificial Intelligence, AAAI'82, pp.155-158, 1982.

M. Frayman, S. Frayman, and . Mittal, Cossack: A constraintbased expert system for configuration tasks, Knowledge-Based Expert Systems in Engineering , Planning and Design, pp.144-166, 1987.

Q. Freuder, E. C. Freuder, and M. J. Quinn, Taking advantage of stable sets of variables in constraint satisfaction problems, IJCAI 1985, pp.1076-1078, 1985.

C. Eugene and . Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of The ACM, vol.29, pp.24-32, 1982.

. Frost, R. Dechter, and . Dechter, In search of the best constraint satisfaction search, Proceeding of Twelfth National Conference of Artificial Intelligence, AAAI'94, pp.301-306, 1994.

. Frost, R. Dechter, and . Dechter, Look-ahead value ordering for constraint satisfaction problems, Proceedings of the 14th international joint conference on Artificial intelligence -Volume 1, IJCAI'95, pp.572-578, 1995.

S. Garrido, K. Garrido, and . Sycara, Multiagent meeting scheduling: Preliminary experimental results, Proceedings of the Second International Conference on Multiagent Systems, ICMAS'96, pp.95-102, 1996.

]. Gaschnig, A constraint satisfaction method for inference making Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems, Proceedings of the Twelfth Annual Allerton Conference on Circuit and System Theory) [ Gaschnig Proceedings of the Second Canadian Conference on Artificial Intelligence, pp.866-874, 1974.

A. Pieter and . Geelen, Dual viewpoint heuristics for binary constraint satisfaction problems, Proceedings of the 10th European conference on Artificial intelligence, ECAI'92, pp.31-35, 1992.

P. Geffner, J. Geffner, and . Pearl, An improved constraintpropagation algorithm for diagnosis, Proceedings of the 10th international joint conference on Artificial intelligence, pp.1105-1111, 1987.

. Gent, An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, CP'96, pp.179-193, 1996.
DOI : 10.1007/3-540-61551-2_74

. Gershman, Asynchronous forward bounding for distributed cops, Journal of Artificial Intelligence Research, vol.34, issue.121, pp.61-88, 2009.

. Ginsberg, . Mcallester, L. Matthew, D. A. Ginsberg, and . Mcallester, GSAT and dynamic backtracking, KR, pp.226-237, 1994.

. Ginsberg, Search lessons learned from crossword puzzles, Proceedings of the eighth National conference on Artificial intelligence -Volume 1, AAAI'90, pp.210-215, 1990.

L. Matthew and . Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, issue.106, pp.25-46, 1993.

. Golomb, . Baumert, W. Solomon, L. D. Golomb, . Baumert et al., Backtrack Programming, 15, and 26.) [ Grant and Smith Proceedings of ECAI'96, pp.516-524, 1965.
DOI : 10.1145/321296.321300

. Hamadi, Backtracking in distributed constraint networks, Proceedings of the European Conference on Artificial Intelligence, ECAI'98, pp.219-223, 1998.

E. Haralick, M. Robert, G. L. Haralick, and . Elliott, Increasing tree search efficiency for constraint satisfaction problems, Proceedings of the 6th international joint conference on Artificial intelligence, IJCAI'79, pp.356-364, 1979.
DOI : 10.1016/0004-3702(80)90051-X

E. Haralick, M. Robert, G. L. Haralick, and . Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

Y. Hirayama, M. Hirayama, and . Yokoo, The effect of nogood learning in distributed constraint satisfaction, Proceedings 20th IEEE International Conference on Distributed Computing Systems, pp.169-177, 2000.
DOI : 10.1109/ICDCS.2000.840919

W. S. Horsch and . Havens, An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic, Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, pp.525-530, 2000.
DOI : 10.1007/3-540-45349-0_43

. Kask, Counting-based lookahead schemes for constraint satisfaction, Proceedings of 10th International Conference on Constraint Programming, pp.317-331, 2004.

F. Léauté, B. Léauté, and . Faltings, Coordinating logistics operations with privacy guarantees, Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp.2482-2487, 2011.

. Léauté, FRODO 2.0: An Open- Source Framework for Distributed Constraint Optimization, Proceedings of the IJCAI'09 workshop on Distributed Constraint Reasoning, pp.160-164, 2009.

. Lecoutre, Backjump-based techniques versus conflict-directed heuristics Distributed Algorithms On seeing things, again, Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI '04 85, and 119.) [ Mackworth Consistency in networks of relationsCited on pages 21 and 22.) [ Mackworth Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI'83, pp.549-557, 1977.

. Maheswaran, Taking dcop to the real world: Efficient complete solutions for distributed multi-event scheduling, Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS'04, 2004.

. Mechqrane, Corrigendum to ???Min-domain retroactive ordering for asynchronous backtracking???, Constraints, vol.14, issue.2, pp.348-355, 2012.
DOI : 10.1007/s10601-012-9122-2

URL : https://hal.archives-ouvertes.fr/lirmm-00748174

O. Lavee, Using additional information in DisCSP search, Proceeding of 5th workshop on distributed constraints reasoning, pp.11-31, 2004.

R. Meisels, Amnon Meisels, and I. Razgon. Distributed forwardchecking with conflict-based backjumping and dynamic ordering, Proceeding of CoSolv workshop, 2002.

Z. Meisels, Asynchronous Forward-checking for DisCSPs, Constraints, vol.161, issue.1???2, pp.131-150, 2007.
DOI : 10.1007/s10601-006-9013-5

. Meisels, Bayes networks for estimating the number of solutions to a csp, Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence, AAAI'97/IAAI'97, pp.179-184, 1997.

. Meisels, Comparing performance of distributed constraints processing algorithms, Proceeding of AAMAS-2002 Workshop on Distributed Constraint Reasoning DCR, pp.86-93, 2002.

. Minton, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence, vol.58, issue.1-3, pp.161-205, 1992.
DOI : 10.1016/0004-3702(92)90007-K

. Modi, Adopt: asynchronous distributed constraint optimization with quality guarantees, Artificial Intelligence, vol.161, issue.1-2, pp.149-180, 2005.
DOI : 10.1016/j.artint.2004.09.003

H. Mohr, T. C. Mohr, and . Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4

URL : https://hal.archives-ouvertes.fr/inria-00548487

L. Nadel, A. Bernard, J. Nadel, and . Lin, Automobile transmission design as a constraint satisfaction problem: modelling the kinematic level, Artificial Intelligence for Engineering, Design, Analysis and Manufacturing, vol.5, issue.03, pp.137-171, 1991.
DOI : 10.1016/0020-0255(74)90008-5

A. Bernard and . Nadel, Some Applications of the Constraint Satisfaction Problem. Number 8 in CSC, 1990.

. Nguyen, Viet Nguyen, Djamila Sam-Haroud, and Boi Faltings. Dynamic distributed backjumping, Proceeding of 5th workshop on DCR'04, 2004.

F. A. Petcu, B. Petcu, and . Faltings, A value ordering heuristic for distributed resource allocation, Proceeding of Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, pp.86-97, 2004.

. Prosser, A constraint maintenance system for the distributed resource allocation problem, Intelligent Systems Engineering, vol.1, issue.1, pp.76-83, 1992.
DOI : 10.1049/ise.1992.0007

]. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.1, issue.4, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8

]. and W. Purdom, Search rearrangement backtracking and polynomial average time, Artificial Intelligence, vol.21, issue.1-2, pp.117-133, 1983.
DOI : 10.1016/S0004-3702(83)80007-1

F. Sabin, E. Sabin, and . Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86

D. Sen, E. H. Sen, and . Durfee, Unsupervised surrogate agents and search bias change in flexible distributed scheduling, Proceedings of the First International Conference on MultiAgent Systems, ICMAS'95, pp.336-343, 1995.

F. Silaghi, Asynchronous aggregation and consistency in distributed constraint satisfaction, Artificial Intelligence, vol.161, issue.1-2, pp.25-53, 2005.
DOI : 10.1016/j.artint.2004.10.003

. Silaghi, Generalized english auctions by relaxation in dynamic distributed CSPs with private constraints, Proceedings of the IJCAI'01 workshop on Distributed Constraint Reasoning, pp.45-54, 2001.

. Silaghi, Consistency Maintenance for ABT, Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP'01, pp.271-285, 2001.
DOI : 10.1007/3-540-45578-7_19

. Silaghi, Hybridizing ABT and AWC into a polynomial space, complete protocol with reordering, p.42, 2001.

. Silaghi, Polynomial space and complete multiply asynchronous search with abstractions (Cited on page 40.) [ Silaghi, 2006 ] Marius-Calin Silaghi. Generalized dynamic ordering for asynchronous backtracking on DisCSPs Trying harder to fail first, Proceedings of the IJCAI'2001 Workshop on Distributed Constraint Reasoning DCR workshop, AAMAS-06 and 90.) [ Smith and Grant ECAICited on page 26.) [ Smith The Brélaz heuristic and optimal static orderings Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming , CP'99, pp.17-32, 1998.

S. Stallman, M. Richard, G. J. Stallman, and . Sussman, Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis, Artificial Intelligence, vol.9, issue.2, pp.135-196, 1977.
DOI : 10.1016/0004-3702(77)90029-7

]. Stefik, Planning with constraints (MOLGEN: Part 1), Artificial Intelligence, vol.16, issue.2, pp.111-139, 1981.
DOI : 10.1016/0004-3702(81)90007-2

. Sultanik, Dcopolis: a framework for simulating and deploying distributed constraint reasoning algorithms A generic arc-consistency algorithm and its specializations, Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, AAMAS'08Cited on page 116.) [ Van Hentenryck et al, pp.1667-1668291, 1992.

]. Vernooy and W. S. Havens, An Examination of Probabilistic Value-Ordering Heuristics, Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence, AI'99, pp.340-352, 1999.
DOI : 10.1007/3-540-46695-9_29

. Wahbi, DisChoco 2: A platform for distributed constraint reasoning, Proceedings of the IJCAI'11 workshop on Distributed Constraint Reasoning, pp.112-121, 2011.

. Wahbi, Mohamed Wahbi, Redouane Ezzahir, Christian Bessiere, and El Houssine Bouyakhf. Nogood-Based Asynchronous Forward-Checking Algorithms, p.116, 2012.

F. Wallace, J. Richard, E. C. Wallace, and . Freuder, Constraintbased multi-agent meeting scheduling: effects of agent heterogeneity on performance and privacy loss, Proceeding of the 3rd workshop on distributed constrait reasoning, DCR'02, pp.176-182, 2002.

. Yeoh, Bnb-adopt: an asynchronous branch-and-bound dcop algorithm, Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, AAMAS'08, pp.591-598, 2008.

K. Hirayama, Distributed breakout algorithm for solving distributed constraint satisfaction problems, Proceedings of the First International Conference on Multi?Agent Systems, p.33, 1995.

. Yokoo, Distributed constraint satisfaction for formalizing distributed problem solving, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems, pp.614-621, 1992.
DOI : 10.1109/ICDCS.1992.235101

. Yokoo, The distributed constraint satisfaction problem: formalization and algorithms, IEEE Transactions on Knowledge and Data Engineering, vol.10, issue.5, pp.673-685, 1998.
DOI : 10.1109/69.729707

M. Zivan, A. Zivan, and . Meisels, Dynamic Ordering for Asynchronous Backtracking on DisCSPs, Constraints, vol.10, issue.1???2, pp.179-197, 2006.
DOI : 10.1007/s10601-006-8062-0

M. Zivan, A. Zivan, and . Meisels, Message delay and DisCSP search algorithms, Annals of Mathematics and Artificial Intelligence, vol.170, issue.1???2, pp.415-439, 2006.
DOI : 10.1007/s10472-006-9033-2

. Zivan, Min-domain retroactive ordering for Asynchronous Backtracking, Constraints, vol.16, issue.2, pp.177-198, 2009.
DOI : 10.1007/s10601-008-9046-z

URL : https://hal.archives-ouvertes.fr/lirmm-00748174

.. An-example-of-the-graph-coloring-problem, 12 1.4 A simple instance of the meeting scheduling problem, p.13

A. Nogood-based, AFC-ng) algorithm running by agent A, p.49

M. Running and A. , 81 4.2 New lines/procedures for MACA-not with respect to MACA-del, p.83

.. Function-update-explanations, 93 5.2 Function Compute Order, p.95