loading...
Natural Deduction Calculus for Computation Tree Logic
Sofia, Bulgari October 03-October 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/JVA.2006.34IEEE John Vincent Atanasoff 2006 Inte ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alexander Bolotov, University of Westminster, UK
Oleg Grigoriev, Moscow State University, Russia
Vasilyi Shangin, Moscow State University, Russia
We 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.
Citation:
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin, "Natural Deduction Calculus for Computation Tree Logic," jva, pp.175-183, IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions