D. Allouche, S. Givry, and T. Schiex, Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP, pp.53-60, 2010.
DOI : 10.1007/978-3-642-15396-9_7

J. Amilphastre, Représentation par automate d'ensemble de solutions de problèmes de satisfaction de contraintes, Thèse de doctorat, 1999.

K. R. Apt, Logic programming Handbook of Theoretical Computer Science, pp.493-574, 1990.

P. Berlandier and B. Neveu, Arc-consistency for dynamic constraint problems : A RMS free approach, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, 1994.

C. Bessière, Arc-consistency in dynamic constraint satisfaction problems, Proceedings of AAAI-91, pp.221-226, 1991.

C. Bessière, Arc-consistency and arc-consistency again, Artificial Intelligence, vol.65, issue.1, pp.179-190, 1994.
DOI : 10.1016/0004-3702(94)90041-8

C. Bessière and J. C. Régin, Arc consistency for general constraint networks : preliminary results, Proceedings IJCAI'97, pp.398-404, 1997.

C. Bessière and J. C. Régin, Rening The Basic Constraint Propagation Algorithm, Proceedings of the 17th International Joint Conference on Articial Intelligence, pp.309-315, 2001.

C. Bessière, A. Maestre, and P. Meseguer, Distributed Dynamic Backtracking, Proc. IJCAI-01 Workshop on Distributed Constraint Reasoning, 2001.
DOI : 10.1007/3-540-45578-7_73

C. Bessière and P. Van-hentenryck, Etre ou ne pas être... une contrainte globale, Proceedings JNPC'03, pp.67-81, 2003.

C. Bessiere, A. Chmeiss, and L. Sais, Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem, Proceedings CP'01, pp.565-569, 2001.
DOI : 10.1007/3-540-45578-7_40

C. Bessière, I. Brito, A. Maestre, and P. Meseguer, Asynchronous backtracking family, 2003.

C. Bessière, A. Maestre, I. Brito, and P. Meseguer, 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

L. Brisoux, Coopération consistante de bases de connaissance au premier ordre ni, Actes des Journées jeunes chercheurs Ganymède, pp.24-28, 1998.

I. Brito and P. Meseguer, Distributed Forward Checking, Proc. 2003, 9th International Conference, pp.801-806, 2003.
DOI : 10.1007/978-3-540-45193-8_56

I. Brito and P. Meseguer, Synchronous, Asynchronous and Hybrid Algorithms for DisCSP, Mark Wallace editor, Principales and Practic of Constraint Programming, 2004.
DOI : 10.1007/978-3-540-30201-8_70

I. Brito-rodringuez, Distributed Constraint Satisfaction, 2007.

A. Bruin, G. Kindervater, and H. Trienekens, Asynchronous parallel branch and bound and anomalies, Parallel Algorithms for Irregularly Structured Problems, 1995.
DOI : 10.1007/3-540-60321-2_29

A. Chmeiss, Sur la consistance de chemin et ses formes partielles, Actes du Congrès AFCET-RFIA 96, pp.212-219, 1996.

A. Chmeiss and P. Jégou, EFFICIENT PATH-CONSISTENCY PROPAGATION, International Journal on Artificial Intelligence Tools, vol.7, issue.02, pp.121-142, 1998.
DOI : 10.1016/0004-3702(92)90020-X

S. Clearwater, B. Huberman, and T. Hogg, Cooperative Solution of Constraint Satisfaction Problems, Science, vol.254, issue.5035, pp.1181-1183, 1991.
DOI : 10.1126/science.254.5035.1181

S. Clearwater, T. Hogg, and B. Huberman, Cooperative Problem Solving Computation : The Micro and the Macro View, World Scientic, pp.33-70, 1992.

J. Conrad and D. Agrawal, Asynchronous Parallel Arc Consistency Algorithms on a Distributed Memory Machine, Journal of Parallel and Distributed Computing, vol.24, issue.1, pp.27-40, 1995.
DOI : 10.1006/jpdc.1995.1004

M. Cooper, An optimal k-consistency algorithm, Artificial Intelligence, vol.41, issue.1, 1989.
DOI : 10.1016/0004-3702(89)90080-5

P. Cooper and M. Swain, Arc consistency: parallelism and domain dependence, Artificial Intelligence, vol.58, issue.1-3, pp.207-235, 1992.
DOI : 10.1016/0004-3702(92)90008-L

E. Coquery, Logique classique, Notes de cours

R. Cowan, Expert systems: aspects of and limitations to the codifiability of knowledge, Research Policy, vol.30, issue.9, pp.1355-1372, 2001.
DOI : 10.1016/S0048-7333(01)00156-1

J. Daemen and V. Rijmen, The design of Rijndael : AES. the Advanced Encryption Standard, 2002.
DOI : 10.1007/978-3-662-04722-4

R. Debruyne, Les algorithmes d'arc-consistance dynamiques. Revue d'intelligence articielle, pp.239-267, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00442824

R. Debruyne and C. Bessière, Domain Filtering Consistencies, Journal of Articial Intelligence Research, vol.14, pp.205-230, 2001.

R. Dechter and I. Meiri, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Proceedings of the tenth International Joint Conference on Articial Intelligence (IJCAI-89), pp.271-277, 1989.
DOI : 10.1016/0004-3702(94)90068-X

P. Dehornoy and F. Ens, Logique et théorie des ensembles, 2006.

H. D. Ebbinghaus, J. Flum, and W. Thomas, Mathematical logic, 1994.
DOI : 10.1007/978-1-4757-2355-7

S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM, vol.28, issue.6, pp.637-647, 1985.
DOI : 10.1145/3812.3818

E. A. Feigenbaum, Knowledge Engineering for the 1980's, 1982.

M. Fieschi, Expert systems for medical consultation Health Policy, pp.159-173, 1986.

E. Freuder, Synthesizing constraint expressions, Communications of the ACM, vol.21, issue.11, pp.958-966, 1978.
DOI : 10.1145/359642.359654

URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA034011&Location=U2&doc=GetTRDoc.pdf

E. Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.
DOI : 10.1145/322290.322292

E. Freuder, A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, issue.4, pp.755-761, 1985.
DOI : 10.1145/4221.4225

D. Frost and R. Dechter, Look-ahead value ordering for constraint satisfaction problems, Proceedings of the International Joint Conference on Articial Intelligence (IJCAI 95), pp.572-578, 1995.

M. Forum, MPI : A Message Passing Interface standard, International Journal of super computer Application, vol.8, issue.3, pp.165-416, 1994.

C. Forgy, Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial Intelligence, vol.19, issue.1, pp.17-37, 1982.
DOI : 10.1016/0004-3702(82)90020-0

J. G. Gasching, Performance Measurement and Analysis of Certain Search Algorithms, pp.79-124, 1979.

J. Gasching, R. Reboh, and J. Reiter, Development of a Knowledge-Based System for Water Resources Problems, 1981.

M. Garey and D. Johnson, Computers and Intractability -A guide to the theory of NP-Completeness, 1979.

E. Gelle and B. Faltings, Solving Mixed and Conditional Constraint Satisfaction Problems, Constraints, pp.107-141, 2003.

F. Geller and M. Veksler, Assumption-Based Pruning in Conditional CSP, VAN BEEK, pp.241-255, 2005.
DOI : 10.1007/11564751_20

R. Greenstadt, J. P. Pearce, E. Bowring, and M. Tambe, Experimental analysis of privacy loss in DCOP algorithms, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems , AAMAS '06, pp.1424-1426, 2006.
DOI : 10.1145/1160633.1160899

R. Dechter and I. Meiri, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Proceedings of the tenth International Joint Conference on Articial Intelligence (IJCAI-89), pp.271-277, 1989.
DOI : 10.1016/0004-3702(94)90068-X

W. Die and M. Hellman, Exhaustive cryptanalysis of the NBS Data Encryption Standard, IEEE Computer, vol.10, pp.74-84, 1977.

R. Génisson, B. Benhamou, and A. Rauzy, Une version concurrente de la procédure de Davis et Putnam. Revue d'intelligence articielle, pp.499-506, 1996.

I. P. Gent and T. Walsh, CSPlib: A Benchmark Library for Constraints, 5th International Conference on Principles and Practice of Constraints Programming, pp.480-481, 1999.
DOI : 10.1007/978-3-540-48085-3_36

A. Gavilanes-franco and F. Lucio-carrasco, A first order logic for partial functions, Theoretical Computer Science, vol.74, issue.1, pp.37-69, 1990.
DOI : 10.1016/0304-3975(90)90005-3

D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-14, 1962.
DOI : 10.1080/00029890.1962.11989827

A. Geist, A. Beguelin, J. Dongarra, R. Manchek, and V. Sunderman, PVM : Parallel Virtuel Machine, 1994.

E. Gelle, On the generation of locally Consistent solution spaces in mixed dynamic constraint problems, 1998.

J. Gaschnig, A general Backtracking algorithm that eliminates most redundant tests, Proceedings IJCAI'77, 1977.

J. Giarratono and G. Riley, Expert systems : Principles and programming, 1998.

M. L. Ginsberg, Dynamic backtracking, J.of Articial Intelligence research, vol.1, pp.25-46, 1993.
DOI : 10.1007/3-540-58601-6_105

URL : http://www.ai.mit.edu/people/dam/dynamic2.ps

F. Glover and M. Laguna, Tabou search, Modern Heuristic Techniques for Combinatorial Problems, 1993.

S. Golumb and L. Baumbert, Backtrack Programming, Journal of the ACM, vol.12, issue.4, pp.516-524, 1965.
DOI : 10.1145/321296.321300

M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

P. M. Gray, S. M. Embury, K. Hui, and G. J. Kemp, The Evolving Role of Constraints in the Functional Data Model, J. Intelligent Information Systems, issue.12, pp.113-137, 1999.

R. F. Grove, Design and development of knowledge-based systems on the web, Proceedings of ISCA 2000 : Ninth International Conference on Intelligence Systems, pp.147-150, 2000.

Y. Hamadi, Traitement des problèmes de satisfaction de contraintes distribués, 1999.

Y. Hamadi, INTERLEAVED BACKTRACKING IN DISTRIBUTED CONSTRAINT NETWORKS, International Journal on Artificial Intelligence Tools, vol.976, issue.3, pp.167-188, 2002.
DOI : 10.1023/A:1010078712316

Y. Hamadi, S. Jabbour, and L. Sais, ManySAT : a parallel SAT solver, In Journal on Satisability, Boolean Modeling and Computation, vol.6, pp.245-262, 2009.

R. Haralick and G. Elliot, 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

F. and H. Roth, Rule-based systems, Communications of the ACM, vol.28, issue.9, pp.921-932, 1985.
DOI : 10.1145/4284.4286

T. Hogg and C. P. Williams, Expected Gains from Parallelizing Constraint Solving for Hard Problems, Proceedings of AAAI 94, pp.331-336, 1994.

P. V. Hentenryck, The OLP Optimization Programming Language, 1999.

P. Jégou, Decomposition of Domains Based on the Micro-Structure of Finite Constraint Satisfaction Problems, Proceedings of AAAI 93, pp.731-736, 1993.

N. Jennings, K. Sycara, and M. Wooldridge, A roadmap of agent research and development, Autonomous Agents and Multi-Agent Systems, vol.1, issue.1, pp.7-38, 1998.
DOI : 10.1023/A:1010090405266

H. Jiang and J. M. Vidal, Reducing Redundant messages in the asynchronous backtracking algorithm, Sixth International Workshop on Distributed Constraint Reasoning, 2005.

D. S. Johnson and M. A. Trick, Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, 1996.

S. Kasif, On the parallel complexity of discrete relaxation in constraint satisfaction networks, Artificial Intelligence, vol.45, issue.3, pp.275-286, 1990.
DOI : 10.1016/0004-3702(90)90009-O

S. Kasif and A. Delcher, Local consistency in parallel constraint satisfaction networks, Artificial Intelligence, vol.69, issue.1-2, pp.307-327, 1994.
DOI : 10.1016/0004-3702(94)90085-X

R. M. Karp and Y. Zhang, Randomized parallel algorithms for backtrack search and branch-and-bound computation, Journal of the ACM, vol.40, issue.3, pp.765-789, 1993.
DOI : 10.1145/174130.174145

A. Kazaz, Application of a Expert System on the Fracture Mechanics of Concrete, Articial Intelligence, pp.177-190, 2003.

M. Kifer and E. Lozinskii, RI: a logic for reasoning with inconsistency, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.253-262, 1988.
DOI : 10.1109/LICS.1989.39180

S. Kirkpatrick, C. Gelatt, and M. Vecchi, Optimization by simulated annealing, Science, pp.671-680, 1983.
DOI : 10.1016/b978-0-08-051581-6.50059-3

URL : http://www.cs.virginia.edu/cs432/documents/sa-1983.pdf

S. H. Liao, Expert system methodologies and applications-a decade review from Expert Systems with applications, pp.93-103, 1995.

L. Lobjois and M. Lemaitre, Coopération entre méthodes complètes et incomplètes pour la résolution de (V)CSP : une tentative d'inventaire, journées Nationales de la Résolution Pratique de Problèmes NP-Complets, pp.67-73

G. F. Luger, Articial Intelligence : Structures and Strategies for Complex Problem Solving, 2002.

H. P. Lundsgaarde, Evaluating medical expert systems, Social Science & Medicine, vol.24, issue.10, pp.805-819, 1987.
DOI : 10.1016/0277-9536(87)90182-1

K. Marriott, M. Wallace, and P. J. Stuckey, Constraint Logic Programming, Foundations of Articial Intelligence, vol.2, pp.409-452, 2006.
DOI : 10.1016/S1574-6526(06)80016-7

P. Meseguer and M. A. Jimenez, Distributed forward checking, Proc. CP-2000 Workshop on Distributed Constraint Satisfaction, 2000.

W. Van-melle, MYCIN: a knowledge-based consultation program for infectious disease diagnosis, International Journal of Man-Machine Studies, vol.10, issue.3, pp.313-322, 1978.
DOI : 10.1016/S0020-7373(78)80049-2

F. Melvin and L. M. Richard, First-Order Modal Logic, 1998.

A. Meisels, Distributed Constraints Satisfaction Algorithm. Performance, Communication, 2004.

A. Meisels and R. Zivan, Asynchronous Forward Checking for distributed CSP, Frontiers in Articial Intelligence and Applications, 2004.

R. H. Michaelson, D. Michie, and A. Boulanger, The Technology of Expert Systems. Byte, pp.303-312, 1985.

M. Minsky, A framework for representing Knowledge. The psychology of computer vision, MCGraw-Hill, pp.211-281, 1975.

S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Minimizing conicts : a heuristic repair method for constraint satisfaction and scheduling problems, Articial Intelligence, vol.58, pp.160-205, 1992.

S. Mittal and B. Falkenhainer, Dynamic constraint satisfaction problems, AAAI, pp.25-32, 1990.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

S. Montani and R. Bellazzi, Supporting decisions in medical applications: the knowledge management perspective, International Journal of Medical Informatics, vol.68, issue.1-3, pp.79-90, 2002.
DOI : 10.1016/S1386-5056(02)00067-9

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

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

J. Naganuma and T. Ogura, A highly OR-parallel inference machine (Multi-ASCA) and its performance evaluation: an architecture and its load balancing algorithms, IEEE Transactions on Computers, vol.43, issue.9, pp.1062-1075, 1994.
DOI : 10.1109/12.312115

S. Nason and J. E. Laird, Soar-RL : integrating reinforcement learning with Soar Cognitive Systems Research, pp.51-59, 2005.

L. Nedovic and V. Devedzic, Expert systems in finance???a cross-section of the field, Expert Systems with Applications, vol.23, issue.1, pp.49-66, 2002.
DOI : 10.1016/S0957-4174(02)00027-1

K. Nissim and R. Zivan, Secure DisCSP protocols -from centralized towards distributed solutions, Proc. 6th workshop on Distributed Constraints Reasoning, DCR-05, 2005.

I. Popescu, Combining Constraints and Consistency Techniques Advances in information system, LNCS, pp.191-200, 1909.

N. Prcovic, B. Neveu, and P. Berlandier, Distribution de l'arbre de recherche des problèmes de satisfaction de contraintes en domaines nis, 2ème Conférence Nationale sur la Résolution de Problèmes NP-Complets, pp.275-290, 1996.

P. 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

M. Rabin, How to exchange secrets by oblivious transfer, 1981.

N. Rao and V. Kumar, Parallel depth first search. Part I. Implementation, International Journal of Parallel Programming, vol.29, issue.1, pp.479-499, 1987.
DOI : 10.1007/BF01389000

J. M. Richer, Une approche de résolution de problèmes en logique des prédicats fondée sur des techniques de satisfaction de contraintes, 1999.

J. M. Richer and J. J. Chabrier, Sacre : a Constraint Satisfaction Based Theorem Prover, Proceedings of AAAI-99, 1999.

R. L. Rivest, A. Shamir, and L. M. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

S. J. Russell and P. Norvig, Articial Intelligence. A Modern Approach, 2003.

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, Mixing Protocol based on the Cooperation and the Parallelism for the Distributed Environment, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008.
DOI : 10.1109/SNPD.2008.171

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, Résolution des problèmes de satisfaction de contraintes distribués à travers le parallélisme, la coopération, et le ltrage. Colloque sur l'Optimisation et les systèmes d'Information COSI, 2008.

B. Saad, F. Herrmann, Y. Lanuel, and T. , Tamisier : a privacy preserving technique for distributed constraint satisfaction problems, 1st International Symposium on Operational Research ISOR 2008, pp.2-6, 2008.

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, DDCSP: Constraint Satisfaction Problem Used for Rule-Based System, 2010 International Conference on Data Storage and Data Engineering, 2010.
DOI : 10.1109/DSDE.2010.51

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, L'hybridation la coopération et le parallélisme pour construire des protocoles robustes pour les CSP distribués, 9ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), 2008.

B. Saad, F. Herrmann, and T. Tamisier, La préservation de la vie privée des problèmes de satisfaction de contraintes distributes, 9ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), 2008.

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, Ecient solving of distributed constraint satisfaction problems through cooperation and parallelism . The 12th World Systemics, Cybernetics and Informatics : WMSCI, 2008.

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, Secure distributed constraint satisfaction problems without using trusted third-party, The 2nd International Conference on Modelling Computation and Optimization in Information Systems and Management Sciences, 2008.

B. Saad, F. Herrmann, Y. Lanuel, and T. Tamisier, Toward a Multicore Reasoning System. 3th Workshop, in Network of the Greater Region for Operational Research and Decision Support Systems, 2010.

D. Sabin and E. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of eleventh ECAI, pp.125-129, 1994.
DOI : 10.1007/3-540-58601-6_86

D. Sabin and E. C. Freuder, Conguration as Composite Constraint Satisfaction, Proceedings of the First Articial Intelligence and Manufacturing Research Planning Workshop, 1996.

N. Sadeh and M. Fox, Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem, 1995.

A. Samal and T. Henderson, Parallel consistent labeling algorithms, International Journal of Parallel Programming, vol.28, issue.1, pp.341-364, 1987.
DOI : 10.1145/322108.322119

P. Sanders, Better algorithms for parallel backtracking, Parallel Algorithms for Irregularly Structured Problems, pp.333-347, 1995.
DOI : 10.1007/3-540-60321-2_27

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

T. Schiex, Réseaux de contraintes. Habilitation à diriger les recherches, 2000.

B. Schneier, Applied cryptography : Protocols, algorithms, and source code in C, 1996.

G. Schreiber, H. Akkermans, A. Anjewierden, R. De-hoog, N. Shadbolt et al., Knowledge Engineering and Management : The CommonKADS Methodology, 2000.

C. P. Schnorr, Ecient Signature Generation for Smart Cards, proceedings of Advances in Cryptology. CRYPTO'89, pp.239-252, 1990.

M. C. Silaghi, Asynchronous solving Problems with Privacy Requirements, 2002.

M. C. Silaghi, D. Sam-haroud, and B. Faltings, Hybridizing ABT and AWC into a polynomial space complete protocol with reordering, 2001.

M. C. Silaghi, Asynchronously Solving Distributed Problems With Privacy Requirements, 2002.

M. C. Silaghi and D. Mitra, Distributed constraint satisfaction and optimization with privacy enforcement, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)., pp.531-535, 2004.
DOI : 10.1109/IAT.2004.1343012

URL : http://www.cs.fit.edu/~msilaghi/papers/IAT04-optimization.pdf

M. C. Silaghi and V. Rajeshirke, The eect of policies for selecting the solution of a discsp on privacy loss, Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, pp.1396-1397, 2004.

M. Singh, Path Consistency Revisited, Proceedings of the 5th International Conference on Tools for Articial Intelligence, pp.318-325, 1995.
DOI : 10.1109/tai.1995.479619

T. Soininen and E. Gelle, Dynamic Constraint Satisfaction in Conguration, AAAI'99, Workshop on Conguration, pp.95-100, 1999.

G. Soloterevsky and E. Gudes, Algorithms for Solving Distributed Constraint Satisfaction Problems (DCSPs), pp.191-198, 1996.

T. Tamisier, F. Feltz, and Y. Didry, Cadral : an automated decisionmaking framework for business collaboration, 12th World Multiconference on Systemics, Cybernetics and Informatics (WMSCI), 2008.

R. Tucho, J. M. Sierra, J. E. Fernández, R. Vijande, and G. Morís, Expert tutoring system for teaching mechanical engineering, Expert Systems with Applications, vol.24, issue.4, pp.415-424, 2003.
DOI : 10.1016/S0957-4174(02)00183-5

É. Vareilles, Conception et approches par propagation de contraintes : contribution à la mise en ouvre d'un outil d'aide interactif, Thèse de doctorat, 2005.

G. Verfaillie and T. Schiex, Dynamic backtracking for dynamic CSP, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, 1994.

G. Verfaillie and T. Schiex, Maintien de solution dans les problèmes dynamiques de satisfaction de contraintes : bilan de quelques approches. Revue d, Intelligence Articielle, vol.9, issue.3, pp.269-309, 1995.

M. Veron and M. Aldanondo, Yet Another Approach to CCSP for conguration problem, ECAI'00, European Conference on Articial Intelligence, Workshop on Conguration, pp.59-62, 2000.

P. R. Visser and V. A. Tamma, An Experiment with Ontology-Based Agent Clustering. IJCAI-99 Workshop on Ontologies and Problem-Solving Methods : Lessons Learned and Future Trends, 1999.

R. J. Wallace and E. C. Freuder, Constraint-based multi-agent meeting Scheduling : Eects of agents heterogeneity on privacy loss, 2002.

R. J. Wallace, Reasoning with possibilities in multiagent graph coloring, 4th Intern Workshop on Distributed Consraint Reasoning, pp.122-130, 2003.

R. J. Wallace and E. C. Freuder, Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving, Artificial Intelligence, vol.161, issue.1-2, pp.209-227, 2005.
DOI : 10.1016/j.artint.2004.10.006

D. Waltz, Understanding line drawings of scenes with shadows In the Psychology of Computer Vision, pp.19-91, 1975.

D. Weyns, H. V. Parunak, F. Michel, T. Holvoet, and J. Ferber, Environments for Multiagent Systems State-of-the-Art and Research Challenges, Lecture Notes in Computer Science, vol.3374, pp.1-47, 2004.
DOI : 10.1007/978-3-540-32259-7_1

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

T. Winograd, FRAME REPRESENTATIONS AND THE DECLARATIVE/PROCEDURAL CONTROVERSY, Representation and Understanding : Studies in Cognitive Science, 1975.
DOI : 10.1016/B978-0-12-108550-6.50012-4

M. Wooldridge and N. R. Jennings, Agent theories, architectures, and languages: A survey, the workshop on agent theories, architectures, and languages on Intelligent agents (ECAI-94), pp.1-39, 1995.
DOI : 10.1007/3-540-58855-8_1

R. M. Wygant, CLIPS ??? A powerful development and delivery expert system tool, Computers & Industrial Engineering, vol.17, issue.1-4, pp.1-4, 1989.
DOI : 10.1016/0360-8352(89)90121-6

Y. Xia and V. K. Prasanna, Parallel exact inference on the Cell Broadband Engine processor. Parallel and Distributed Computing, pp.558-572, 2010.

P. Xidonas, E. Ergazakis, K. Ergazakis, K. Metaxiotis, D. Askounis et al., On the selection of equity securities: An expert systems methodology and an application on the Athens Stock Exchange, Expert Systems with Applications, vol.36, issue.9, pp.11966-11980, 2009.
DOI : 10.1016/j.eswa.2009.03.066

A. Yao, Protocols for secure computations, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982.
DOI : 10.1109/SFCS.1982.38

M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara, 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

M. Yokoo, Asynchronous weak-commitement search for solving distributed constraint satisfaction problems, Proceedings the First International Conference on Principale and Practice of Constraint Programming (CP-95), pp.88-102, 1995.
DOI : 10.1007/3-540-60299-2_6

M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara, 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. Yokoo and T. Ishida, Algorithms for agents, pp.165-199, 1999.

M. Yokoo, Algorithms for Distributed Constraint Satisfaction Satisfaction problems : A review, Autonomous Agents & Multi-Agent System, vol.3, pp.198-212, 2000.

M. Yokoo, K. Suzuki, and K. Hirayama, Secure distributed constraint satisfaction: reaching agreement without revealing private information, Artificial Intelligence, vol.161, issue.1-2, pp.229-245, 2005.
DOI : 10.1016/j.artint.2004.10.007

Y. Zhang and A. Mackworth, Parallel and Distributed Finite Constraint Satisfaction : Complexity, Algorithms and Experiments. Parallel Processing for Articial Intelligence, 1993.
DOI : 10.1016/b978-0-444-81704-4.50018-1

R. Zivan and A. Meisels, Synchronous vs asynchronous search on DisCSP, Proceedings European. Wokshop on Multi Agent system, 2003.

R. Zivan and A. Meisels, Concurrent backtrack search for DisCSP, Proceedings FLAIRS-04, 2004.

R. Zivan and A. Meisels, Concurrent Dynamic Backtracking for Distributed CSPs, Proceedings Constraint Programming, pp.782-787, 2004.
DOI : 10.1007/978-3-540-30201-8_66