Sciweavers

LATA
2012
Springer
12 years 7 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...
LATA
2012
Springer
12 years 7 months ago
Conservative Groupoids Recognize Only Regular Languages
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...
Danny Dubé, Mario Latendresse, Pascal Tesso...
LATA
2012
Springer
12 years 7 months ago
A Faster Grammar-Based Self-index
Travis Gagie, Pawel Gawrychowski, Juha Kärkk&...