Travelled to:1 × France
1 × Spain
2 × United Kingdom
Collaborated with:H.Vollmer M.Thomas O.Beyersdorff M.Lück I.Schindler J.Schmidt S.Müller N.Creignou R.Ktari J.Müller F.Olive
Talks about:complex (4) logic (4) parameter (3) default (3) autoepistem (1) proposit (1) fragment (1) courcell (1) theorem (1) problem (1)
Person: Arne Meier
DBLP: Meier:Arne
Contributed to:
20152012
20102009Wrote 5 papers:
- LATA-2015-CreignouKMMOV #problem
- Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.
- LATA-2015-LuckMS #complexity #theorem
- Parameterized Complexity of CTL — A Generalization of Courcelle’s Theorem (ML, AM, IS), pp. 549–560.
- LATA-2012-MeierSTV #complexity #logic #on the
- On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.
- SAT-2010-BeyersdorffMMTV #complexity #logic #proving
- Proof Complexity of Propositional Default Logic (OB, AM, SM, MT, HV), pp. 30–43.
- SAT-2009-BeyersdorffMTV #complexity #logic #reasoning
- The Complexity of Reasoning for Fragments of Default Logic (OB, AM, MT, HV), pp. 51–64.