Advertisement

Constructing finite state implementations of knowledge-based programs with perfect recall (Extended abstract)

  • Ron van der Meyden
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1209)

Abstract

Knowledge-based programs have been proposed as an abstract formalism for the design of multi-agent protocols, based on the idea that an agent's actions are a function of its state of knowledge. The key questions in this approach concern the relationship between knowledge-based programs and their concrete implementations, in which the actions are a function of the agents' local states. In previous work we have shown that with respect to a perfect recall semantics for knowledge, finite state implementations of knowledge-based programs do not always exist. Indeed, determining the existence of such an implementation is undecidable. However, we also identified a sufficient condition under which the existence of a finite state implementation is guaranteed, although this sufficient condition is also undecidable. We show in this paper that there nevertheless exists an approach to the optimization of implementations that results in a finite state implementation just when the sufficient condition holds. These results contribute towards a theory of automated synthesis of multi-agent protocols from knowledge-based specifications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ben84]
    J. van Benthem. Correspondence theory. In Handbook of Philosophical Logic II: Extensions of Classical Logic, pages 167–247. D. Reidel, Dordrecht, 1984.Google Scholar
  2. [BLMS]
    R.I. Brafman, J-C. Latombe, Y. Moses, and Y. Shoham. Applications of a logic of knowledge to motion planning under uncertainty. Journal of the ACM. to appear.Google Scholar
  3. [BR83]
    S. Brookes and W. Rounds. Behavioural equivalence relations induced by programming logics. In Proc. ICALP, pages 97–108. Springer LNCS No. 154, 1983.Google Scholar
  4. [Che80]
    B. Chellas. Modal Logic. Cambridge University Press, Cambridge, 1980.Google Scholar
  5. [FHMV95a]
    R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Knowledge-based programs. In Proc. ACM Symposium on Principles of Distributed Computing, 1995.Google Scholar
  6. [FHMV95b]
    R. Fagin, J. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, MA, 1995.Google Scholar
  7. [HM85]
    M. Hennessy and R. Milner. Algebraic laws for non-determinism and concurrency. Journal of the ACM, 32(1):137–161, 1985.CrossRefGoogle Scholar
  8. [HM90]
    J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549–587, 1990.Google Scholar
  9. [KS90]
    P.C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes and three problems of equivalence. Information and Computation, 86:43–68, 1990.CrossRefGoogle Scholar
  10. [Mey94]
    R. van der Meyden. Common knowledge and update in finite environments I. In Proc. of the Conf. on Theoretical Aspects of Reasoning about Knowledge, pages 225–242, 1994.Google Scholar
  11. [Mey96a]
    R. van der Meyden. Finite state implementations of knowledge-based programs. In Proc. Conf. on Foundations of Software Technology and The oretical Computer Science, December 1996. Hyderabad, India. Springer LNCS to appear.Google Scholar
  12. [Mey96b]
    R. van der Meyden. Knowledge-based programs: on the complexity of perfect recall in finite environments. In Proc. of the Conf. on Theoretical Aspects of Rationality and Knowledge, pages 31–50. Morgan Kaufmann, 1996.Google Scholar
  13. [Mil90]
    R. Milner. Operational and algebraic semantics of concurrent processes. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 1201–1242. Elsevier Science Publishers B.V., Amsterdam, 1990.Google Scholar
  14. [PT87]
    R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973–989, 1987.Google Scholar
  15. [RG92]
    A.S. Rao and M. Georgeff. An abstract architecture for intelligent agents. In Proc. Int. Joint. Conf. on Artificial Intelligence, pages 439–449, 1992.Google Scholar
  16. [RK86]
    S.J. Rosenschein and L.P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J.Y. Halpern, editor, Theoretical Aspects of Reasoning about knowledge: Proc. 1986 Conf., pages 83–98. Morgan Kaufman, Los Altos, CA, 1986.Google Scholar
  17. [Sho93]
    Y. Shoham. Agent oriented programming. Artificial Intelligence, 60(1):51–92, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Ron van der Meyden
    • 1
  1. 1.Computing ScienceUniversity of Technology, SydneyBroadwayAustralia

Personalised recommendations