Constraint-based protocols for distributed problem solving

Science of Computer Programming

Volumn 30, Issue 1-2, 1998, Pages 201-225

  Borghoff, Uwe M ^a   Pareschi, Remo ^a   Arcelli, Francesca ^b   Formato, Ferrante ^c  

^a XEROX RESEARCH CENTRE EUROPE   (France)

^b UNIVERSITY OF SALERNO   (Italy)

^c Ctro Ric Matemat Pura A   (Italy)

Author keywords

Constraint propagation; Constraint based knowledge brokers; Cooperative agents; Distributed artificial intelligence; Distributed problem solving; Protocols

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SOFTWARE; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING;

CONCURRENT CONSTRAINT PROGRAMMING (CCP); COOPERATIVE SOFTWARE AGENTS; DISTRIBUTED PROBLEM SOLVING (DPS);

NETWORK PROTOCOLS;

EID: 0031642488     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(97)00011-7     Document Type: Article

References (43)

1. J.-M. Andreoli, U.M. Borghoff, R. Pareschi, Constraint-based knowledge brokers, in: H. Hong (Ed.), Proc. 1st Internat. Symp. on Parallel Symbolic Computation (PASCO'94), Hagenberg/Linz, Austria, 1994, Lecture Notes Series in Computing, Vol. 5, World Scientific, Singapore, pp. 1-11.
2. J.-M. Andreoli, U.M. Borghoff, R. Pareschi, The constraint-based knowledge broker model: Semantics, implementation and analysis, J. Symbol. Comput. 21 (4) (1996) 635-667.
3. J.-M. Andreoli, U.M. Borghoff, R. Pareschi, J.H. Schlichter, Constraint agents for the information age, J. Universal Comput. Sci. 1 (12) (1995) 762-789. Electronic version available at http://www.iicm.edu/jucs.
4. J.-M. Andreoli, R. Pareschi, Communication as fair distribution of knowledge, in: Proc. Conf. on ObjectOriented Programming Systems, Languages and Applications (OOPSLA'91), Phoenix, AZ, November 1991, ACM SIGPLAN Notices 26 (11) 212-229.
5. F. Arcelli, U.M. Borghoff, F. Formato, R. Pareschi, Tuning constraint-based communication in distributed problem solving, in: Proc. 1st Internat. Workshop on Concurrent Constraint Programming (CCP'95), Venice, Italy, May 1995.
6. J.-P. Banâtre, D. Le Métayer, The GAMMA m and its discipline of programming, Science of Computer Programming 15 (1990) 55-77.
7. G. Berry, G. Boudol, The chemical abstract machine, in: Proc. 17th ACM SIGACT/SIGPLAN Annual Symp. on Principles of Programming Languages, San Francisco, CA, 1990, pp. 81-94.
8. U.M. Borghoff, LOKIT: A toolkit for building distributed collaborative applications, Rank Xerox Research Centre, Grenoble Lab., France, Technical Report CT-002, May 1994.
9. U.M. Borghoff, R. Pareschi, H. Karch, M. Nöhmeier, J.H. Schlichter, Constraint-based information gathering for a network publication system, in: B. Crabtree, N. Jennings (Eds.), Proc. 1st Internat. Conf. on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM'96), London, UK, 1996, The Practical Application Company Ltd., Blackpool, UK, pp. 45-59.
10. U.M. Borghoff, J.H. Schlichter, On combining the knowledge of heterogeneous information repositories, J. Universal Comput. Sci. 2 (7) (1996) 515-532. Electronic version available at http://www.iicm.edu/jucs.
11. N. Carriero, D. Gelernter, How To Write Parallel Programs. A First Course, MIT Press, Cambridge, MA, 1990.
12. K.L. Clark, PARLOG and its applications, IEEE Trans. Software Engrg. 14 (12) (1988) 1792-1804.
13. S.H. Clearwater, B.A. Huberman, T. Hogg, Cooperative solution of constraint satisfaction problems, Science 254 (1991) 1181-1183.
14. P. Codognet, F. Rossi, NMCC: Constraint enforcement and retraction in CC programming, in: Proc. 12th Internat. Conf. on Logic Programming (ICLP'95), Kanagawa, Japan, 1995, MIT Press, Cambridge, MA.
15. R. Davis, R.G. Smith, Negotiation as a metaphor for distributed problem solving, Artif. Intell. 20 (1) (1983) 63-109.
16. F.S. de Boer, J.N. Kok, C. Palamidessi, J. Rutten, Non-monotonic concurrent constraint programming, in: D. Miller (Ed.), Proc. Internat. Logic Programming Symp. (ILPS'93), 1993, MIT Press, Cambridge, MA, pp. 315-334.
17. K.S. Decker, E.H. Durfee, V.R. Lesser, The evaluation of research in cooperative distributed problem solving, in: M.N. Huhns, L. Gasser (Eds.), Distributed Artificial Intelligence, 1989, Research Notes in Artificial Intelligence, Vol. 2. Pitman/Morgan Kaufmann, San Mateo.
18. E.H. Durfee, V.R. Lesser, D.D. Corkill, Trends in cooperative distributed problem solving, IEEE Trans. on Knowledge and Data Engrg. 1 (1) (1989) 63-83.
19. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-102.
20. S. Haridi et al., Concurrent constraint programming at SICS with the Andorra Kernel Language, in: P. Kanellakis, J.-L. Lassez, V. Saraswat (Eds.), Proc. 1st Workshop on Principles and Practice of Constraint Programming, Providence, RI, 1993.
21. P. v. Hentenryck, Constraint satisfaction in logic programming, Logic Programming Series, MIT Press, Cambridge, MA, 1989.
22. M. Henz, G. Smolka, J. Würtz, Object-oriented concurrent constraint programming in Oz, in: P. v. Hentenryck, V. Saraswat (Eds.), Principles and Practice of Constraint Programming, MIT Press, Cambridge, MA, 1995, pp. 27-48.
23. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proc. 14th ACM SIGACT/SIGPLAN Annual Symp. on Principles of Programming Languages, Munich, Germany, January 1987, ACM, New York, pp. 111-119.
24. S. Janson, S. Haridi, Programming paradigms of the Andorra kernel language, in: V. Saraswat, K. Ueda (Eds.), Proc. Internat. Logic Programming Symp. (ILPS'91), San Diega, CA, 1991, MIT Press, Cambridge, MA.
25. D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1973.
26. S. Lander, V.R. Lesser, Customizing distributed search among agents with heterogeneous knowledge, in: T.W. Finin, C.K. Nicholas, Y. Yesha (Eds.), Proc. 1st Internat. Conf. on Information and Knowledge Management, Baltimore, MD, November 1992, Springer, Berlin.
27. J. Meseguer, A logical theory of concurrent objects and its realization in the Maude language, in: G.A. Agha, A. Yonezawa, P. Wegner (Eds.), Research Directions in Concurrent Object Oriented Programming, MIT Press, Cambridge, MA, 1992, pp. 314-390.
28. G. Nelson, D.C. Oppen, Simplification by cooperating decision procedures, ACM Trans. Programming Languages Systems 1 (2) (1979) 245-257.
29. T. Oates, M.V.N. Prasad, V.R. Lesser, Cooperative information gathering: A distributed problem solving approach, Dept. Computer Science, Univ. Massachusetts, Amherst, MA, Technical Report TR-94-66, 1994.
30. F.C.N. Pereira, D.H.D. Warren, Parsing as deduction, Proc. 21st Annual Meeting of the Association for Computational Linguistics, MIT, Cambridge, MA, 1983.
31. G.-C. Roman, H.C. Cunningham, Mixed programming metaphors in a shared dataspace model of concurrency, IEEE Trans. Software Engrg. 16 (12) (1990) 1361-1373.
32. V.A. Saraswat, Concurrent constraint programming languages, PhD thesis, Carnegie-Mellon University, Pittsburg, PA, 1989.
33. V.A. Saraswat, R. Jagadeesan, V. Gupta, Foundations of timed concurrent constraint programming. Proc. 9th IEEE Symp. on Logic in Computer Science, Paris, France, 1994, IEEE Comp. Soc. Press, Los Alamitos, CA, pp. 71-80.
34. V.A. Saraswat, P. Lincoln, Higher order linear concurrent constraint programming, Technical Report, Xerox Palo Alto Research Center, Palo Alto, CA, 1992.
35. V.A. Saraswat, M. Rinard, P. Panangaden, Semantic foundations of concurrent constraint programming, in: Proc. 18th ACM SIGACT/SIGPLAN Annual Symp. on Principles of Programming Languages, Orlando, FL, January 1991, ACM, New York, pp. 333-352.
36. M.P. Schützenberger, Sur une variante des fonctions sequentielles, Theoret. Comput. Sci. 4 (1977).
37. M.P. Schützenberger, The critical factorization theorem, in: M. Lothaire (Ed.), Combinatorics on Words, Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley, Reading, MA, 1983.
38. E. Shapiro, The family of concurrent logic programming languages, ACM Comput. Surveys 21 (3) (1989) 413-510.
39. R.G. Smith, The contract net protocol: High-level communication and control in a distributed problem solver, IEEE Trans. Comput. C-29 (12) (1980) 1104-1113.
40. K. Ueda, Guarded horn clauses, in: E. Wada (Ed.), Logic Programming, 1986, Lecture Notes in Computer Science, Vol. 221, Springer, Berlin, pp. 168-179.
41. L. Vielle, Recursive axioms in deductive databases: The query-subquery approach, in: L. Kerschberg (Ed.), Proc. 1st Conf. on Expert Database Systems, Benjamin/Cummings, Menlo Park, CA, April 1986.
42. J.-M. Andreoli, U.M. Borghoff, R. Pareschi, Signed feature constraint solving, Proc. 3rd Internat. Conf. on the Practical Application of Constraint Technology (PACT'97), London, UK, April 1997, The Practical Application Company Ltd., Blackpool, UK.
43. U.M. Borghoff, P.-Y. Chevalier, J. Willamowski, Adaptive refinement of search patterns for distributed information gathering, in: A. Verbraeck (Ed.), Proc. Internat. Conf. EuroMedia/WEBTEC '96, London, UK, December 1996, The Society for Computer Simulation, San Diego, CA, pp. 5-12.