Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)

Details Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version) Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)

2011-02-10

arxiv.org/abs/1102.2174v2

Computer Science

Logic in Computer Science

Extended version of a paper submitted at TIME 2011: contains proofs, additional examples & figures, additional comparison betw

Scientific paper

This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one logic to the other. Some consequences about complexity are given. We report about first experiments and the consequences about possible improvements in existing implementations are analyzed.

Affiliated with

Also associated with

No associations

Rating

Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694695