"The Complexity of Propositional Linear Temporal Logics in Simple Cases."

Stéphane Demri, Philippe Schnoebelen (2002)

> Home

Details and statistics

DOI: 10.1006/INCO.2001.3094

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/DemriS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/DemriS02
Stéphane Demri, Philippe Schnoebelen:
The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. 174(1): 84-103 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.