- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
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
- Ereignis
-
Veröffentlichung
- (wo)
-
Hannover, Hannover
- (wer)
-
Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
- (wann)
-
2008
- Urheber
-
Meier, Arne
Mundhenk, Martin
Thomas, Michael
Vollmer, Heribert
- DOI
-
10.15488/1518
- URN
-
urn:nbn:de:101:1-2020071506184862062511
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:46 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Meier, Arne
- Mundhenk, Martin
- Thomas, Michael
- Vollmer, Heribert
- Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
Entstanden
- 2008
Ähnliche Objekte (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