Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)
Logic in Computer Science
2011-04-20 v2 Artificial Intelligence
Abstract
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.
Keywords
Cite
@article{arxiv.1102.2174,
title = {Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)},
author = {Vincent Aravantinos and Ricardo Caferra and Nicolas Peltier},
journal= {arXiv preprint arXiv:1102.2174},
year = {2011}
}
Comments
Extended version of a paper submitted at TIME 2011: contains proofs, additional examples & figures, additional comparison between classical LTL/schemata algorithms up to the provided translations, and an example of how to do model checking with schemata; 36 pages, 8 figures