Advertisement

Lithuanian Mathematical Journal

, Volume 45, Issue 2, pp 217–224 | Cite as

A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions

  • J. Sakalauskaite
Article
  • 43 Downloads

Abstract

We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.

Keywords

agents knowledge wishes commitment interaction dynamic logic sequent calculus cut rule soundness completeness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. 1.
    R. A. Schmidt, D. Tishkovsky, and U. Hustadt, Interaction between knowledge, action and commitment within agent dynamic logic, Studia Logica, 78(3), 381–415.Google Scholar
  2. 2.
    M. K. Valiev, Propositional programming logics, in: Voprosy Kibernetiki [in Russian], Moscow (1982), pp. 23–36.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • J. Sakalauskaite
    • 1
  1. 1.Institute of Mathematics and InformaticsVilniusLithuania

Personalised recommendations