THI > Institut > Mitarbeiter > Arne Meier
Dr. rer. nat. Arne Meier
Kontaktinformationen
+55° 59' 1.51",
-3° 18' 55.74"
Institut für Theoretische Informatik
Fakultät für Elektrotechnik und Informatik
Universität Hannover
Appelstraße 4
30167 Hannover
| Raum: | 219 |
| Telefon: | +49 511 762 19768 |
| Fax: | +49 511 762 19606 |
| E-Mail: | meier * (mein PGP Public Key, MIME Zertifikat) |
* und das Suffix (at)thi(dot)uni(minus)hannover(dot)de
Supervised Courses
- Lecture Komplexität von Algorithmen (SS 12)
- Lecture Advanced Logics (SS 12)
- Exercises Advanced Logics (SS 12)
- Exercises Formale Sprachen (WS11)
- Exercises Grundlagen der Theoretischen Informatik (SS 11)
- Seminar Description Logics (WS10)
- Seminar Spieltheorie (SS 10)
- Exercises Formale Sprachen (WS 09)
- Exercises Komplexität von Algorithmen (SS 09)
- Exercises Grundlagen der Theoretischen Informatik (WS 08/09)
- Exercises Komplexität von Algorithmen (SS 08)
- Exercises Grundlagen der Theoretischen Informatik (WS 07/08)
Abstract Wordle
Veröffentlichungen
2012 | |
| 16. |
Journal ACM Transactions on Computational Logic (TOCL)
13(2):1--22
April
2012
ISSN: 1529-3785
Bemerkung: A preliminary version appeared in: Dagstuhl Seminar Proceedings, Vol. 10061 in Circuits, Logic, and Games, http://drops.dagstuhl.de/opus/volltexte/2010/2523, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010. |
| 15. |
Proceedings of the 6th International Conference on Language and Automata Theory and Applications. LNCS
März
2012
akzeptiert
|
2011 | |
| 14. |
Leibniz Universität Hannover,
November
2011
ISBN: 3869559292
|
| 13. |
Archive for Mathematical Logic
50:727-742
Juni
2011
ISSN: 0933-5846
Bemerkung: A preliminary version appeared in: Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing, Band 6175 aus Lecture Notes in Computer Science, Seite 30-43, Springer, 2010. |
| 12. |
Logical Methods in Computer Science
7(2:12)
2011
Bemerkung: A preliminary version appeared in: Proc. of the 16th International Symposium on Temporal Representation and Reasoning, IEEE Computer Society Press, 2009. |
| 11. |
Journal of Logic and Computation
2011
Bemerkung: A preliminary version appeared in: Proc. 12th International Conference on Theory and Applications of Satisfiability Testing, Vol. 5584 of Lecture Notes in Computer Science, pp. 51-64, Springer, 2009. |
| 10. |
Proceedings of the 8th Annual Conference on Theory and Application of Models of Computation, LNCS 6648
, Seite 552-562.
2011
|
2010 | |
| 9. |
Journal of Applied Logic
8(4):409-421
Dezember
2010
Bemerkung: A preliminary version appeared in: Proc. 34th International Symposium on Mathematical Foundations of Computer Science, Vol. 5754 of Springer Lecture Notes in Computer Science, pp. 587-599, 2009. |
| 8. |
Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing, Band 6175 aus Lecture Notes in Computer Science, Seite 30-43.
Herausgeber: Springer,
2010
Bemerkung: Also appeared in: Circuits, Logic, and Games, Vol. 10061 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010. |
| 7. |
International Workshop on Hybrid Logic and Applications
2010
|
| 6. |
In , und , Editor, Proc. of the 23rd International Workshop on Description Logics (DL 2010), Band 573, Seite 279--290.
Waterloo, Canada
2010
|
| 5. |
Technical Report
Institut für Theoretische Informatik, Leibniz Universität Hannover,
2010
|
2009 | |
| 4. |
Information Processing Letters
109(18):1071-1077
2009
ISSN: 0020-0190
|
| 3. |
International Journal of Foundations of Computer Science
20(5):901-918
2009
Bemerkung: Also appeared in: Proc. 2nd Workshop on Reachability Problems in Computational Models, Vol. 223 of Electronic Notes in Theoretical Computer Science, pp. 201--213, 2008. |
2007 | |
| 2. |
Master's Thesis
Leibniz Universität Hannover, Institut für Theoretische Informatik
2007
|
2005 | |
| 1. |
Bachelor's Thesis
Leibniz Universität Hannover, Institut für Theoretische Informatik,
2005
|
Talks
November 14, 2011 (Disputationsvortrag):
On the Complexity of Modal Logic Variants and their Fragments [slides as pdf]
May 4, 2010 (The 23rd International Workshop on Description Logics, Waterloo, Canada):
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC [slides as pdf]
February 18, 2009 (56. Workshop über Komplexität und Effiziente Algorithmen):
The Complexity of Reasoning for Fragments of Default Logic [slides as pdf]
September 17, 2008 (2nd Workshop on Reachability Problems):
The Complexity of Satisfiability for Fragments of CTL and CTL* [slides as pdf]
September 09, 2008 (55. Workshop über Algorithmen und Komplexität, associated with the conference INFORMATIK 2008):
The Complexity of Satisfiability for Fragments of CTL and CTL* [slides as pdf]
Top
