Author of the publication

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.

, , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 549-560. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Paradigms for Parameterized Enumeration, , , , and . Theory Comput. Syst., 60 (4): 737--758 (2017)Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem., , and . CoRR, (2014)Enumeration in Incremental FPT-Time.. CoRR, (2018)Parameterised Complexity of Abduction in Schaefer's Framework, , and . Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings, page 195--213. (2020)Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics., , , and . ACM Trans. Comput. Log., 21 (1): 7:1-7:18 (2020)Parameterised complexity of model checking and satisfiability in propositional dependence logic., and . Ann. Math. Artif. Intell., 90 (2-3): 271-296 (2022)Parameterised Complexity for Abduction., , and . CoRR, (2019)The model checking fingerprints of CTL operators., , and . Acta Inf., 56 (6): 487-519 (2019)Logics with Probabilistic Team Semantics and the Boolean Negation., , , , , and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 665-680. Springer, (2023)Parameterized complexity of abduction in Schaefer's framework., , and . J. Log. Comput., 31 (1): 266-296 (2021)