activity
20092023
most citedComplexity of Propositional Abduction for Restricted Sets of Boolean Functions

1 citations · 4 across the 9 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 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…