The Complexity of Propositional Linear Temporal Logics.
A. Prasad Sistla, Edmund M. Clarke:
The Complexity of Propositional Linear Temporal Logics.
J. ACM 32(3): 733-749(1985)@article{DBLP:journals/jacm/SistlaC85,
author = {A. Prasad Sistla and
Edmund M. Clarke},
title = {The Complexity of Propositional Linear Temporal Logics},
journal = {J. ACM},
volume = {32},
number = {3},
year = {1985},
pages = {733-749},
ee = {db/journals/jacm/SistlaC85.html, http://doi.acm.org/10.1145/3828.3837},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- James Bailey, Szabolcs Mikulás:
Expressiveness Issues and Decision Problems for Active Database Event Queries.
ICDT 2001: 68-82
- Burkhard Freitag, Bernhard Steffen, Tiziana Margaria, Ulrich Zukowski:
An Approach to Intelligent Software Library Management.
DASFAA 1995: 71-78
- Jan Chomicki, Damian Niwinski:
On the Feasibility of Checking Temporal Integrity Constraints.
PODS 1993: 202-213
- Joel E. Richardson:
Supporting Lists in a Data Model (A Timely Approach).
VLDB 1992: 127-138
- Jan Chomicki, Tomasz Imielinski:
Temporal Deductive Databases and Infinite Objects.
PODS 1988: 61-73
BibTeX
Copyright © Sun May 17 00:05:43 2009
by Michael Ley (ley@uni-trier.de)