Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Complexity of Generalized Satisfiability for Linear Temporal Logic"

Michael Bauland et al. (2009)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-06-25

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-0812-4848
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0812-4848
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Log. Methods Comput. Sci. 5(1) (2009)

a service of

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.