Location of Repository

Natural deduction calculus for computation tree logic

By Alexander Bolotov, Oleg Grigoriev and Vasilyi Shangin

Abstract

The authors present a natural deduction calculus for the computation tree logic, CTL, defined with the full set of classical and temporal logic operators. The system extends the natural deduction construction of the linear-time temporal logic. This opens the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various applications in AI and computer science, where the branching-time setting is required

Topics: UOW3
Publisher: IEEE
OAI identifier: oai:westminsterresearch.wmin.ac.uk:3585
Provided by: WestminsterResearch

Suggested articles

Preview

Citations

  1. (2005). Automated first order natural deduction.
  2. (1998). Automatic theorem-proving in intuitionistic propositional logic.
  3. (2006). Clausal resolution method for extended computation tree logic ECTL.
  4. (1984). Deciding full branching time logic.
  5. (1981). Design and synthesis of synchronisation skeletons using branching time temporal logic.
  6. (2006). Natural deduction calculus for linear-time temporal logic.
  7. (1950). On natural deduction.
  8. (2000). Reasoning about Rational Agents.
  9. (2006). Specifcation and verifcation of reconfguration protocols in grid component systems.
  10. (1990). Temporal and Modal Logic.
  11. (1994). The Proof Theory and Semantics of Intuitionistic Modal Logic.
  12. (1998). Using state space exploration and a natural deduction style message derivation engine to verify security protocols.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.