The Complexity of Satisfiability for Fragments of CTL and CTL*

Arne Meier; Martin Mundhenk; Michael Thomas; Heribert Vollmer

doi:10.1016/j.entcs.2008.12.040

Details

Originalsprache	Englisch
Titel des Sammelwerks	Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)
Seiten	201-213
Seitenumfang	13
Band	223
Publikationsstatus	Veröffentlicht - 2008

Publikationsreihe

Name	Electron. Notes Theor. Comput. Sci.

Zitieren

The Complexity of Satisfiability for Fragments of CTL and CTL*. / Meier, Arne; Mundhenk, Martin; Thomas, Michael et al.
Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Band 223 2008. S. 201-213 (Electron. Notes Theor. Comput. Sci.).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review

Meier, A, Mundhenk, M, Thomas, M & Vollmer, H 2008, The Complexity of Satisfiability for Fragments of CTL and CTL*. in Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Bd. 223, Electron. Notes Theor. Comput. Sci., S. 201-213. https://doi.org/10.1016/j.entcs.2008.12.040

Meier, A., Mundhenk, M., Thomas, M., & Vollmer, H. (2008). The Complexity of Satisfiability for Fragments of CTL and CTL*. In Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008) (Band 223, S. 201-213). (Electron. Notes Theor. Comput. Sci.). https://doi.org/10.1016/j.entcs.2008.12.040

Meier A, Mundhenk M, Thomas M, Vollmer H. The Complexity of Satisfiability for Fragments of CTL and CTL*. in Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Band 223. 2008. S. 201-213. (Electron. Notes Theor. Comput. Sci.). doi: 10.1016/j.entcs.2008.12.040

Meier, Arne ; Mundhenk, Martin ; Thomas, Michael et al. / The Complexity of Satisfiability for Fragments of CTL and CTL*. Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Band 223 2008. S. 201-213 (Electron. Notes Theor. Comput. Sci.).

Download

@inproceedings{56678839adc241f09cb15b15df1af121,

title = "The Complexity of Satisfiability for Fragments of CTL and CTL*",

author = "Arne Meier and Martin Mundhenk and Michael Thomas and Heribert Vollmer",

note = "Funding information: 1 Supported in part by DFG VO 630/6-1. 2 Email: meier@thi.uni-hannover.de 3 Email: mundhenk@cs.uni-jena.de 4 Email: thomas@thi.uni-hannover.de 5 Email: vollmer@thi.uni-hannover.de",

year = "2008",

doi = "10.1016/j.entcs.2008.12.040",

language = "English",

volume = "223",

series = "Electron. Notes Theor. Comput. Sci.",

pages = "201--213",

booktitle = "Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)",

}

Download

TY - GEN

T1 - The Complexity of Satisfiability for Fragments of CTL and CTL*

AU - Meier, Arne

AU - Mundhenk, Martin

AU - Thomas, Michael

AU - Vollmer, Heribert

N1 - Funding information: 1 Supported in part by DFG VO 630/6-1. 2 Email: meier@thi.uni-hannover.de 3 Email: mundhenk@cs.uni-jena.de 4 Email: thomas@thi.uni-hannover.de 5 Email: vollmer@thi.uni-hannover.de

PY - 2008

Y1 - 2008

U2 - 10.1016/j.entcs.2008.12.040

DO - 10.1016/j.entcs.2008.12.040

M3 - Conference contribution

VL - 223

T3 - Electron. Notes Theor. Comput. Sci.

SP - 201

EP - 213

BT - Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)

ER -

Research@Leibniz University

The Complexity of Satisfiability for Fragments of CTL and CTL*

Autoren

Organisationseinheiten

Details

Publikationsreihe

Zitieren

Von denselben Autoren

Counting Complexity for Reasoning in Abstract Argumentation

Strong Backdoors for Default Logic

Parameterized complexity of weighted team definability

Submodel Enumeration for CTL Is Hard

Quantitative Claim-Centric Reasoning in Logic-Based Argumentation