Forschungsprojekt

GenMod - Generische Algorithmen und Komplexitätsschranken für Koalgebraische Modallogiken

Dieses Projekt entwickelt eine Erweiterung herkömmlicher existierender generisches algorithmischer Methoden für koalgebraische Modallogik, welches als ein generisches semantisches Rahmenwerk in allgemeinem Sinne angesehen werden. Darüber hinause werden die so entwickelten Algorithmen in einem Werkzeug implementiert, welches damit den bestehenden Coalgebraic Logic Satisfiability Solver (CoLoSS) erweitert.

Kontakt

Ansprechpartner: Prof. Dr. Lutz Schröder
Projektleitung: Prof. Dr. Lutz Schröder

Beteiligte Forschungsbereiche

Publikationen

  • 2011
  • 2010
  • Daniel Hausmann; Lutz Schröder
    Optimizing Conditional Logic Reasoning within CoLoSS.
    In: Thomas Bolander; Torben Braüner (Hrsg.). Methods for Modalities (M4M-6, 2009). Methods for Modalities (M4M-6), 6th Workshop on Methods for Modalities, November 12-14, Kopenhagen, Denmark, Pages 157-171, Electronic Notes in Theoretical Computer Science (ENTCS), Vol. 262, Elsevier, Amsterdam, 5/2010.
  • Carsten Lutz; Lutz Schröder
    Probabilistic Description Logics for Subjective Uncertainty.
    In: Fangzhen Lin; Ulrike Sattler (Hrsg.). Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning. International Conference on Principles of Knowledge Representation and Reasoning (KR-2010), 12th, May 9-13, Toronto, Ontario, Canada, AAAI Press, Menlo, CA, 5/2010.
  • Lutz Schröder; Dirk Pattinson
    Named Models in Coalgebraic Hybrid Logic.
    In: Jean-Yves Marion; Thomas Schwentick (Hrsg.). Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science. International Symposium on Theoretical Aspects of Computer Science (STACS-2010), 27th, March 4-6, Nancy, France, Pages 645-656, Leibniz International Proceedings in Informatics, Vol. 5, Schloss Dagstuhl - Leibniz-Center of Informatics, Dagstuhl, Germany, 3/2010.
  • Lutz Schröder; Dirk Pattinson
    Coalgebraic correspondence theory.
    In: Luke Ong (Hrsg.). Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures. International Conference on Foundations of Software Science and Computation Structures (FoSSaCS-2010), 13th, located at ETAPS 2010, March 20-28, Paphos, Cyprus, Pages 328-342, Lecture Notes in Computer Science, Vol. 6014, Springer, Berlin, 3/2010.
  • Lutz Schröder; Dirk Pattinson; Daniel Hausmann
    Optimal Tableaux for Conditional Logics with Cautious Monotonicity.
    In: Michael Wooldridge (Hrsg.). Proceedings of the 19th European Conference on Artificial Intelligence. European Conference on Artificial Intelligence (ECAI-2010), 19th, August 16-20, Lisbon, Portugal, Frontiers in Artificial Intelligence and Applications, IOS Press, 8/2010.
  • Lutz Schröder; Yde Venema
    Flat coalgebraic fixed point logics.
    In: Paul Gastin; François Laroussinie (Hrsg.). Proceedings of the 21st International Conference on Concurrency Theory. International Conference on Concurrency Theory (CONCUR-2010), 21st, August 31 - September 3, Paris, France, Lecture Notes in Computer Science, Springer, Berlin, 8/2010.
  • Lutz Schröder; Dirk Pattinson
    Rank-1 modal logics are coalgebraic.
    In: Journal of Logic and Computation (JLC), Vol. 20, No. 5, Pages 1113-1147, Oxford University Press, Oxford, 2010.
  • Dirk Pattinson; Lutz Schröder
    Cut Elimination in Coalgebraic Logics.
    In: Information and Computation (Inform. Comput.), Vol. 208, Pages 1447-1468, Elsevier, Amsterdam, 12/2010.
  • 2009
  • Lutz Schröder; Dirk Pattinson
    PSPACE Bounds for Rank-1 Modal Logics.
    In: ACM Transactions on Computational Logic (TOCL), Vol. 10, No. 2, Pages 13:3-13:33, ACM, 2/2009.
  • Rob Myers; Dirk Pattinson; Lutz Schröder
    Coalgebraic Hybrid Logic.
    In: Luca de Alfaro (Hrsg.). Foundations of Software Science and Computation Structures. International Conference on Foundations of Software Science and Computation Structures (FoSSaCS-09), 12th, located at Joint European Conferences on Theory and Practice of Software, ETAPS 2009, March 22-25, York, United Kingdom, Pages 137-151, Lecture Notes in Computer Science (LNCS), Vol. 5504, ISBN 0302-9743, Springer, 2009.
  • Dirk Pattinson; Lutz Schröder
    Generic Modal Cut Elimination Applied to Conditional Logics.
    In: Martin Giese; Arild Waaler (Hrsg.). Automated Reasoning with Analytic Tableaux and Related Methods. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-09), July 6-10, Oslo, Norway, Lecture Notes in Computer Science, Vol. 5607, Springer, 2009.
  • Lutz Schröder; Dirk Pattinson; Clemes Kupke
    Nominals for Everyone.
    In: Craig Boutilier (Hrsg.). International Joint Conferences on Artificial Intelligence. International Joint Conference on Artificial Intelligence (IJCAI-09), July 11 - June 17, Pasadena, CA, United States, Pages 917-922, AAAI Press; Menlo Park, CA, 2009.
  • Lutz Schröder; Dirk Pattinson
    Strong completeness of coalgebraic modal logics.
    In: Susanne Albers; Jean-Yves Marion (Hrsg.). International Symposium on Theoretical Aspects of Computer Science. International Symposium on Theoretical Aspects of Computer Science (STACS-09), February 26-28, Freiburg, Germany, Pages 673-684, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; Dagstuhl, Germany, 2009.
  • Daniel Hausmann; Lutz Schröder
    Optimizing Conditional Logic Reasoning within CoLoSS.
    In: Thomas Bolander; Torben Braüner (Hrsg.). Proceedings of the 6th Workshop on Methods for Modalities. Methods for Modalities (M4M-6), November 12-14, Copenhagen, Denmark, Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier, Amsterdam, 2009.
  • 2008