Travelled to:
1 × Canada
1 × Italy
1 × South Africa
1 × Spain
2 × United Kingdom
Collaborated with:
H.Vollmer A.Meier J.Schmidt O.Beyersdorff N.Creignou P.McKenzie F.Katritzke W.Merzenich S.Müller
Talks about:
complex (4) logic (4) default (3) proposit (2) boolean (2) autoepistem (1) parameter (1) extension (1) techniqu (1) restrict (1)
Person: Michael Thomas
DBLP: Thomas:Michael
Contributed to:
Wrote 6 papers:
- LATA-2012-MeierSTV #complexity #logic #on the
- On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.
- KR-2010-CreignouST #abduction #complexity #set #strict
- Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).
- 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.
- CSL-2008-McKenzieTV
- Extensional Uniformity for Boolean Circuits (PM, MT, HV), pp. 64–78.
- CIAA-2001-KatritzkeMT #automaton #clustering #finite #image #using
- Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata (FK, WM, MT), pp. 177–189.