A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions
- 43 Downloads
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.
Keywordsagents knowledge wishes commitment interaction dynamic logic sequent calculus cut rule soundness completeness
Unable to display preview. Download preview PDF.
- 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.M. K. Valiev, Propositional programming logics, in: Voprosy Kibernetiki [in Russian], Moscow (1982), pp. 23–36.Google Scholar