1. Restrictions for loop-check in sequent calculus for temporal logic with until operator
- Author
-
Adomas Birštunas
- Subjects
For loop ,Check-in ,Computer science ,loop-check ,lcsh:Mathematics ,Sequent calculus ,ComputerSystemsOrganization_PROCESSORARCHITECTURES ,lcsh:QA1-939 ,Algebra ,Tree (data structure) ,Mathematics::Logic ,Operator (computer programming) ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,sequent calculus ,until operator ,TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS ,Computer Science::Logic in Computer Science ,Temporal logic ,branchnig-time temporal logic - Abstract
In this paper, we present sequent calculus for branching-time temporal logic with until operator. This sequent calculus uses efficient loop-checktechinque. We prove that we can use not all but only several special sequents from the derivation tree for the loop-check. We use indexes to discover these special sequents in the sequent calculus. These restrictions let us to get efficient decision procedure based on introduced sequent calculus.
- Published
- 2009