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. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-71389-0_5

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fossacs/BaulandSSSV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/BaulandSSSV07
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62

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.