Proving epistemic and temporal properties from knowledge based programs

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we investigate two approaches for representing and reasoning about knowledge evolution in Multi-Agent System MAS. We use the language of the Logic of Time and Knowledge TKL [5] as a specification language for the whole system, and for each agent, we use Knowledge Based Programs KBP,[4]. We propose a method to translate a a KBP system into a set of TKL formulas. The translation method presented provides an strategy to model and prove properties of MAS without being attached to local or global representations, giving the alternative to switch from one representation to another. We also present a formal model of computation to our KBP system and prove the correctness our translation function w.r.t. this model.In order to illustrate usefulness of the translation method two examples are presented: the Muddy Children Puzzle and the Bit Exchange Protocol. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Benevides, M., Delgado, C., & Carlini, M. (2008). Proving epistemic and temporal properties from knowledge based programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5249 LNAI, pp. 134–144). Springer Verlag. https://doi.org/10.1007/978-3-540-88190-2_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free