![]() | ![]() |
2008 | ||
---|---|---|
3 | EE | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic CoRR abs/0808.3884: (2008) |
2 | EE | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Propositional Implication CoRR abs/0811.0959: (2008) |
1 | EE | 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) |
1 | Olaf Beyersdorff | [2] [3] |
2 | Martin Mundhenk | [1] |
3 | Michael Thomas | [1] [2] [3] |
4 | Heribert Vollmer | [1] [2] [3] |