36 citations
- Niki (Greece)GR4 papers
- University of StuttgartDE3 papers
- Aix-Marseille UniversitéFR1 paper
- Computer Science Laboratory of Lille1 paper
- Gottfried-Wilhelm-Leibniz-GesellschaftDE1 paper
- Laboratoire d’Informatique Fondamentale de MarseilleFR1 paper
- Leibniz University HannoverDE1 paper
- Polytechnique MontréalCA1 paper
- Universität GreifswaldDE1 paper
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2011★ 1 cited
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
Arne Meier, Johannes Schmidt, Michael Thomas +1
We investigate the application of Courcelle's Theorem and the logspace version of Elberfeld etal. in the context of the implication problem for propositional sets of formulae, the…
cs.CC2010★ 2 cited
On the Applicability of Post's Lattice
Michael Thomas
For decision problems P defined over Boolean circuits from a restricted set of gates, we have that P(B) AC0 many-one reduces to P(B') for all finite sets B and B' of gates such tha…
cs.CC2010
Complexity Classifications for Propositional Abduction in Post's Framework
Nadia Creignou, Johannes Schmidt, Michael Thomas
In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aim…