Sciweavers

JAPLL
2010
111views more  JAPLL 2010»
13 years 6 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
KR
2010
Springer
14 years 4 months ago
Towards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
Wolfgang Dvorák, Reinhard Pichler, Stefan W...