Theoretische Informatik

Kontaktinformationen

Institut für Theoretische Informatik
Fakultät für Elektrotechnik und Informatik
Universität Hannover
Appelstraße 4
30167 Hannover

•	Complexity of Model Checking for Modal Dependence Logic Johannes Ebbing und Peter Lohmann CoRR 1104.1034:1-21 2011 http://arxiv.org/abs/1104.1034
•	Abstraction for Model Checking Modular Interpreted Systems over ATL Michael Köster und Peter Lohmann 9th International Workshop on Programming Multi-Agent Systems 2011 2011 akzeptiert
•	Complexity of two-variable Dependence Logic and IF-Logic Juha Kontinen, Antti Kuusisto, Peter Lohmann und Jonni Virtema Logic in Computer Science (LICS 2011) 2011 akzeptiert http://arxiv.org/abs/1104.3148
•	Complexity Results for Modal Dependence Logic Peter Lohmann und Heribert Vollmer Proceedings 19th Conference on Computer Science Logic, Band 6247 aus Lecture Notes in Computer Science, Seite 411--425. Herausgeber: Springer Berlin / Heidelberg, 2010 Institut für Theoretische Informatik, Leibniz Universität Hannover, Appelstr. 4, 30167 Hannover, Germany http://arxiv.org/abs/1104.0607
•	Fragments of Temporal Logic and Formal Languages Peter Lohmann Master thesis Leibniz University Hannover, 2008

Export als:

August 20, 2010 (European Summer School for Logic, Language and Information 2010, Workshop on Dependence and Independence in Logic, Kopenhagen):
Complexity Results for Modal Dependence Logic (slides)
June 9, 2010 (Logic Seminar, Helsinki):
Complexity Results for Modal Dependence Logic
February 10, 2010 (Dagstuhl Seminar 10061 - Circuits, Logic, and Games):
Complexity Results for Modal Dependence Logic (slides)
February 18, 2009 (56. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen, Ulm):
Fragments of Temporal Logic and Formal Languages (slides)