The constraint-based knowledge broker model: Semantics, implementation and analysis

Journal of Symbolic Computation

Volumn 21, Issue 4-6, 1996, Pages 635-667

  Andreoli, Jean Marc ^a   Borghoff, Uwe M ^a   Pareschi, Remo ^a  

^a XEROX RESEARCH CENTRE EUROPE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030115611     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0035     Document Type: Article

References (36)

1. Andreoli, J.-M., Pareschi, R. (1991). Communication as fair distribution of knowledge. In Proc. Conf. on Object-Oriented Programming Systems, Languages and Applications (OOPSLA '91), pp. 212-229, Phoenix, AZ, November. ACM SIGPLAN Notices 26:11.
2. Andreoli, J.-M., Ciancarini, P., Pareschi, R. (1992). Interaction abstract machines. In Agha, G.A., Yonezawa, A., Wegner, P. (eds), Research Directions in Concurrent Object-Oriented Programming, pp. 257-280. Cambridge, MA: MIT Press.
3. Andreoli, J.-M., Borghoff, U.M., Pareschi, R. (1994). Constraint-based knowledge brokers. In Hong, H. (ed.), Proc. 1st Int. Symp. on Parallel Symbolic Computation (PASCO '94), pp. 1-11, Hagenberg/Linz, Austria, September. Lecture Notes Series in Computing 5, Singapore, World Scientific.
4. Andreoli, J.-M., Borghoff, U.M., Pareschi, R., Schlichter, J.H. (1995). Constraint agents for the information age. J. Universal Computer Science, 1(12):762-789. Electronic version available at http://hyperg.iicm.tu-graz.ac.at/jucs.
5. Andreoli, J.-M. (1992). Logic programming with focusing proofs in linear logic. J. Logic and Computation, 2(3):297-347.
6. Arcelli, F., Borghoff, U.M., Formato, F., Pareschi, R. (1995). Tuning constraint-based communication in distributed problem solving. In Proc. 1st Int. Workshop on Concurrent Constraint Programming (CCP '95), Venice, Italy, May.
7. Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J. (1986). Magic sets and other strange ways to implement logic programs. In Proc. 5th ACM SIGACT/SIGMOD Symp. on Principles of Database Systems, pp. 1-15, Cambridge, MA, March.
8. Beeri, C., Ramakrishnan, R. (1991). On the power of magic. J. Logic Programming, 10(3&4):255-299.
9. Borghoff, U.M., Schlichter, J.H. (1996). On combining the knowledge of heterogeneous information repositories. J. Universal Computer Science, 2(7):515-532. Electronic version available at http://hyperg.iicm.tu-graz.ac.at/jucs
10. Borghoff, U.M., Pareschi, R., Arcelli, F., Formato, F. (to appear). Constraint-based protocols for distributed problem solving. Science of Computer Programming.
11. Borghoff, U.M. (1995). A procedural specification of the constraint-based knowledge broker model with partial results. Technical Report, Rank Xerox Research Centre, Grenoble Lab., France, May.
12. Chawathe, S., Garcia-Molina, H., Hammer, J., Ireland, K., Papakonstantinou, Y., Ullman, J., Widom, J. (1994). The Tsimmis project: Integration of heterogeneous information sources. In Proc. IPSJ Conf., Tokyo, Japan, October. Los Alamitos, CA: IEEE Comp. Soc. Press.
13. Codognet, P., Rossi, F. (1995). NMCC: Constraint enforcement and retraction in cc programming. In Proc. 12th Int. Conf. on Logic Programming (ICLP '95), Kanagawa, Japan, June. Cambridge, MA: MIT Press.
14. de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J. (1993). Non-monotonic concurrent constraint programming. In Miller, D. (ed.), Proc. Int. Logic Programming Symp. (ILPS '93), pp. 315-334. Cambridge, MA: MIT Press.
15. Decker, K.S., Durfee, E.H., Lesser, V.R. (1989). The evaluation of research in cooperative distributed problem solving. In Huhns, M.N., Gasser, L. (eds), Distributed Artificial Intelligence. Research Notes in Artificial Intelligence 2. San Mateo: Pitman/Morgan Kaufmann.
16. Denzinger, J. (1995). Knowledge-based distributed search using Teamwork. In Lesser, V. (ed.), Proc. 1st Int. Conf. on Multi-Agent Systems (ICMAS '95), pp. 81-88, San Francisco, CA, June. Menlo Park, Cambridge, London: AAAI Press, MIT Press.
17. Durfee, E.H., Lesser, V.R., Corkill, D.D. (1989). Trends in cooperative distributed problem solving. IEEE Transactions on Knowledge and Data Engineering, 1(1):63-83.
18. Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102.
19. Fikes, R., Engelmore, R., Farquhar, A., Pratt, W. (1995). Network-based information brokers. In Proc. AAAI Spring Symp. Series on Information Gathering from Distributed Heterogeneous Environments, Stanford, CA, March.
20. Hentenryck, P.V. (1989). Constraint satisfaction in logic programming. In Logic Programming Series. Cambridge, MA: MIT Press.
21. Henz, M., Smolka, G., Würtz, J. (1995). Object-oriented concurrent constraint programming in Oz. In Hentenryck, P.V., Saraswat, V. (eds), Principles and Practice of Constraint Programming, pp. 27-48. Cambridge, MA: MIT Press.
22. Jaffar, J., Lassez, J.-L. (1987). Constraint logic programming. In Proc. 14th ACM SIGACT/SIGPLAN Annual Symp. on Principles of Programming Languages, pp. 111-119, Munich, Germany, January. New York, ACM.
23. Kay, M. (1980). Algorithm schemata and data structure in syntactic processing. Technical report, Xerox Palo Alto Research Center, Palo Alto, CA.
24. Lander, S., Lesser, V.R. (1992). Customizing distributed search among agents with heterogeneous knowledge. In Finin, T.W., Nicholas, C.K., Yesha, Y. (eds), Proc. 1st Int. Conf. on Information and Knowledge Management, Baltimore, MD, November. Berlin, Springer-Verlag.
25. Malone, T.W., Crowston, K. (1994). The interdisciplinary study of coordination. ACM Computing Surveys, 26(1):87-119.
26. Nelson, G., Oppen, D.C. (1979). Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257.
27. Numaoka, C., Tokoro, M. (1990). A decentralized parsing method using communicating multiple concurrent objects. In Proc. 2nd Int. Conf. of Technology of Object Oriented Languages and Systems, Paris, France.
28. Oates, T., Prasad, M.V.N., Lesser, V.R. (1994). Cooperative information gathering: A distributed problem solving approach. Technical Report TR-94-66, Dept. of Computer Science, Univ. of Massachusetts, Amherst, MA.
29. OMG, CORBA (1991). The Common Object Request Broker: Architecture and Specification. Object Management Group and X/Open. OMG Document Number 91.12.1, Rev. 1.1; X/Open Prelim. Spec, of ORB component of CAE.
30. Pereira, F.C.N., Warren, D.H.D. (1983). Parsing as deduction. In Proc. 21st Annual Meeting of the Association for Computational Linguistics, MIT, Cambridge, MA, June.
31. Provost, T., Le Wallace, M. (1993). Generalized constraint propagation over the CLP scheme. J. Logic Programming, 16(3&4):319-359.
32. Rounds, W., Kasper, R. (1986). A complete logical calculus for record structures representing linguistic information. In Proc. 1st IEEE Symp. on Logic in Computer Science, Boston, MA.
33. Saraswat, V.A. (1989). Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, Pittsburg, PA.
34. Smolka, G. (1992). Feature constraint logics for unification grammars. J. Logic Programming, 12(1&2):51-87.
35. Vielle, L. (1986). Recursive axioms in deductive databases: The query-subquery approach. In Kerschberg, L. (ed.), Proc. 1st Conf. on Expert Database Systems, Menlo Park, CA, April. Benjamin/Cummings Publ. Company.
36. Yonezawa, A., Ohsawa, I. (1988). Object-oriented parallel parsing for context-free grammars. In Vargha, D. (ed.), Proc. 12th Int. Conf. on Computational Linguistics (COLING '88), Vol. 2, pp. 773-778, Budapest, Hungary, August.