Name
Abstract | ||
|---|---|---|
This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced in elsewhere 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIME.2011.11 | TIME |
Keywords | Field | DocType |
well-known linear temporal logic,polynomial-time reduction,propositional schemata,propositional schema,possible improvement,indexes,automata,grammar,computational complexity,temporal logic,pspace,encoding,semantics,satisfiability | Autoepistemic logic,Interval temporal logic,Computer science,Zeroth-order logic,Theoretical computer science,Linear temporal logic,Well-formed formula,Propositional variable,Dynamic logic (modal logic),Intermediate logic | Conference |
Citations | PageRank | References |
3 | 0.41 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Aravantinos | 1 | 86 | 10.29 |
| Ricardo Caferra | 2 | 303 | 29.85 |
| Nicolas Peltier | 3 | 50 | 11.84 |