- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Meier, Arne; Mundhenk, M.; Thomas, Michael; Vollmer, Heribert: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. In: Electronic Notes in Theoretical Computer Science 223 (2008), Nr. C, S. 201-213. DOI: https://doi.org/10.1016/j.entcs.2008.12.040
- Event
-
Veröffentlichung
- (where)
-
Hannover, Hannover
- (who)
-
Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
- (when)
-
2008
- Creator
-
Meier, Arne
Mundhenk, Martin
Thomas, Michael
Vollmer, Heribert
- DOI
-
10.15488/1518
- URN
-
urn:nbn:de:101:1-2020071506184862062511
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Meier, Arne
- Mundhenk, Martin
- Thomas, Michael
- Vollmer, Heribert
- Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
Time of origin
- 2008
Other Objects (12)
Proof complexity of Satisfiability Modulo Theories
The complexity of generalized satisfiability for linear temporal logic
Parametrised complexity of satisfiability in temporal logic
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Algorithms for Satisfiability beyond Resolution
Algorithms for the satisfiability problem
Satisfiability problems
Satisfiability of the smallest binary program
Satisfiability of the smallest binary program
Satisfiability characterizations of upward planarity problems
A PSpace-algorithm for ALCQI-satisfiability
Proof complexity of Satisfiability Modulo Theories
The complexity of generalized satisfiability for linear temporal logic
Parametrised complexity of satisfiability in temporal logic
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Algorithms for Satisfiability beyond Resolution
Algorithms for the satisfiability problem
Satisfiability problems
Satisfiability of the smallest binary program
Satisfiability of the smallest binary program
Satisfiability characterizations of upward planarity problems
A PSpace-algorithm for ALCQI-satisfiability
Proof complexity of Satisfiability Modulo Theories
The complexity of generalized satisfiability for linear temporal logic
Parametrised complexity of satisfiability in temporal logic
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Algorithms for Satisfiability beyond Resolution
Algorithms for the satisfiability problem
Satisfiability problems
Satisfiability of the smallest binary program
Satisfiability of the smallest binary program
Satisfiability characterizations of upward planarity problems