The Complexity of Propositional Linear Temporal Logics in Simple Cases

Stéphane Demri, Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput., 174(1):84-103, 2002. [doi]

@article{DemriS02:0,
  title = {The Complexity of Propositional Linear Temporal Logics in Simple Cases},
  author = {Stéphane Demri and Ph. Schnoebelen},
  year = {2002},
  url = {http://www.idealibrary.com/links/doi/10.1006/inco.2001.3094},
  tags = {logic},
  researchr = {https://researchr.org/publication/DemriS02%3A0},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {174},
  number = {1},
  pages = {84-103},
}