Nichtklassische Logiken: Parametrisierte Komplexität und Enumeration

Es wird die dblp-Klassifikation verwendet.

[BIB] Arne Meier, Christian Reinbold:
Enumeration Complexity of Poor Man's Propositional Dependence Logic. FoIKS 2018: 303-321.
[BIB] Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. LATA 2018: 130-142.

[BIB] Martin Lück, Arne Meier, Irena Schindler:
Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log. 18(1): 1:1-1:32 (2017).
[BIB] Arne Meier, Christian Reinbold:
Enumeration Complexity of Poor Man's Propositional Dependence Logic. CoRR abs/1704.03292 (2017).

[BIB] Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler:
Backdoors for Linear Temporal Logic. IPEC 2016: 23:1-23:17.
[BIB] Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Strong Backdoors for Linear Temporal Logic. CoRR abs/1602.04934 (2016).
[BIB] Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. SAT 2016: 45-59.

[BIB] Andreas Krebs, Arne Meier, Jonni Virtema:
A Team Based Variant of CTL. TIME 2015: 140-149.
[BIB] Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. TIME 2015: 59-68.
[BIB] Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6): 685-710 (2015).
[BIB] Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. LATA 2015: 549-560.
[BIB] Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. CoRR abs/1504.06187 (2015).

[BIB] Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400.

[BIB] Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011).