Sciweavers

LATA
2012
Springer
11 years 12 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
IPL
2010
107views more  IPL 2010»
13 years 2 months ago
Disjoint pattern matching and implication in strings
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
Leonid Libkin, Cristina Sirangelo