The Complexity of Clausal Fragments of LTL

@inproceedings{Artale2013TheCO,
  title={The Complexity of Clausal Fragments of LTL},
  author={Alessandro Artale and Roman Kontchakov and Vladislav Ryzhikov and Michael Zakharyaschev},
  booktitle={LPAR},
  year={2013}
}
We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine the computational complexity of the satisfiability problem for each of the fragments, which ranges from NLogSpace to PTime, NP and PSpace. 
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

Similar Papers

Loading similar papers…