- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Luck, M.; Meier, A.; Schindler, I.: Parametrised complexity of satisfiability in temporal logic. In: ACM Transactions on Computational Logic 18 (2017), Nr. 1, 1. DOI: https://doi.org/10.1145/3001835
- Event
-
Veröffentlichung
- (where)
-
Hannover, Hannover
- (who)
-
Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
- (when)
-
2017
- DOI
-
10.15488/1212
- URN
-
urn:nbn:de:101:1-2020060412543681598256
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:42 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
- Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
Time of origin
- 2017
Other Objects (12)
The complexity of generalized satisfiability for linear temporal logic
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Proof complexity of Satisfiability Modulo Theories
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
The Complexity of Satisfiability for Fragments of CTL and CTL⋆
On the Satisfiability of Temporal Logics with Concrete Domains
A satisfiability algorithm for a typed feature logic
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity
Temporal Logic
Logic and complexity
New results on probabilistic verification : automata, logic and satisfiability
Markov temporal logic
The complexity of generalized satisfiability for linear temporal logic
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Proof complexity of Satisfiability Modulo Theories
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
The Complexity of Satisfiability for Fragments of CTL and CTL⋆
On the Satisfiability of Temporal Logics with Concrete Domains
A satisfiability algorithm for a typed feature logic
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity
Temporal Logic
Logic and complexity
New results on probabilistic verification : automata, logic and satisfiability
Markov temporal logic
The complexity of generalized satisfiability for linear temporal logic
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Proof complexity of Satisfiability Modulo Theories
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
The Complexity of Satisfiability for Fragments of CTL and CTL⋆
On the Satisfiability of Temporal Logics with Concrete Domains
A satisfiability algorithm for a typed feature logic
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity
Temporal Logic
Logic and complexity
New results on probabilistic verification : automata, logic and satisfiability