 | 2009 |
|---|
| 7 |       | Arne Meier,
Martin Mundhenk,
Thomas Schneider,
Michael Thomas,
Volker Weber,
Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.
MFCS 2009: 587-599 |
| 6 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic.
SAT 2009: 51-64 |
| 5 | | Arne Meier,
Martin Mundhenk,
Thomas Schneider,
Michael Thomas,
Volker Weber,
Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
CoRR abs/0906.1489: (2009) |
| 4 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The complexity of propositional implication.
Inf. Process. Lett. 109(18): 1071-1077 (2009) |
| 2008 |
|---|
| 3 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic
CoRR abs/0808.3884: (2008) |
| 2 | | Olaf Beyersdorff,
Arne Meier,
Michael Thomas,
Heribert Vollmer:
The Complexity of Propositional Implication
CoRR abs/0811.0959: (2008) |
| 1 | | Arne Meier,
Martin Mundhenk,
Michael Thomas,
Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL*.
Electr. Notes Theor. Comput. Sci. 223: 201-213 (2008) |
