Bolotov, Alexander (2008) Tackling "until induction" in natural deduction for PLTL. In: Proceedings of the 15th workshop on automated reasoning: bridging the gap between theory and practice: CICM 2008, Conferences on Intelligent Computer Mathematics, University of Birmingham, UK. School of Computer Science, Birmingham.Full text not available from this repository.
We investigate the problem of induction in the natural deduction construction of propositional linear-time temporal logic. The well known induction with the "always in the future" operator has been an obstacle in our previous developments of the proof search. Here we modify the formulation of the calculus by introducing new rules to deal with the "until" operator, show the correctness of a modified system and define proof search strategies for new rules based upon fixpoint characterisation of the Until operator.
|Item Type:||Book Section|
|Subjects:||University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)|
|Depositing User:||Miss Nina Watts|
|Date Deposited:||22 Jan 2009 11:37|
|Last Modified:||14 Oct 2009 09:13|
Actions (login required)
|Edit Item (Repository staff only)|