Parameterized Complexity of CTL

DOI10.1007/978-3-319-15579-1_43zbMath1451.68138OpenAlexW791469391WikidataQ57998290 ScholiaQ57998290MaRDI QIDQ2799205

Arne Meier, Martin Lück, Irina Schindler

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_43

zbMATH Keywords

temporal logicparameterized complexitycomputation tree logicCourcelle's theorem

Mathematics Subject Classification ID

Temporal logic (03B44) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Parameterized Complexity of CTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision procedures and expressiveness in the temporal logic of branching time
• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Parametrized complexity theory.
• Parameterized Complexity of CTL
• On the Parameterized Complexity of Default Logic and Autoepistemic Logic
• Does Treewidth Help in Modal Satisfiability?

This page was built for publication: Parameterized Complexity of CTL