Logo of University of Manchester, established 1824, links to university home page

Univ. Manchester > School of Comp. Science > IMG > Thomas Schneider > Publications

Thomas Schneider's Publications

Journal Articles

  1. A. Meier, M. Mundhenk, T. Schneider, M. Thomas V. Weber, and H. Vollmer: The Complexity of Satisfiability for Fragments of Hybrid Logic — Part I. Accepted for a special issue on hybrid logic of the Logic Journal of the IGPL, 2010.     Abstract
    This is an extended version of the MFCS paper 7.
     
  2. M. Mundhenk, T. Schneider, T. Schwentick, V. Weber: Complexity of Hybrid Logics over Transitive Frames. Accepted for a special issue on hybrid logic of the Logic Journal of the IGPL, 2010.     Abstract
    This is an extended version of the M4M paper 20.
     
  3. M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. Logical Methods in Computer Science, 5(1), 2009.    Abstract    BIB    PDF
    This is an extended version of the FoSSaCS paper 14.
     
  4. M. Mundhenk, T. Schneider: The Complexity of Hybrid Logics over Equivalence Relations. Journal of Logic, Language and Information, 18(4), 493–514, 2009.    Abstract    BIB    PDF
    This is an extended version of the HyLo paper 15 in the special issue "Hybrid Logic" of JoLLI.
     

Reviewed Conference and Workshop Papers

  1. B. Parsia and T. Schneider: The modular structure of an ontology: an empirical study. Accepted for KR 2010.     Abstract     Extended PDF
     
  2. B. Parsia, U. Sattler, and T. Schneider: Mechanisms for Importing Modules. In Proc. OWLED, volume 529 of CEUR, 2009.     Abstract     BIB     PDF
     
  3. Superseded by Article 1:     A. Meier, M. Mundhenk, T. Schneider, M. Thomas V. Weber, and H. Vollmer: The Complexity of Satisfiability for Fragments of Hybrid Logic — Part I. In Proc. 34th MFCS, pp. 587–599, 2009.     Abstract     BIB     DOI
     
  4. U. Sattler, T. Schneider, and M. Zakharyaschev: Which Kind of Module Should I Extract? In Proc. 22nd DL, 2009.     Abstract     BIB     PDF     Extended PDF
     
  5. O. Beyersdorff, A. Meier, M. Mundhenk, T. Schneider, M. Thomas, and H. Vollmer: Model Checking CTL is Almost Always Inherently Sequential. In Proc. 16th TIME, 2009.     Abstract     BIB     PDF
     
  6. R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P. Selmer, F. Wolter, and M. Zakharyaschev: Minimal Module Extraction from DL-Lite Ontologies using QBF Solvers. In Proc. 21st IJCAI, pp. 836–841, 2009.    Abstract    BIB    PDF
     
  7. B. Parsia, U. Sattler, and T. Schneider: Easy Keys for OWL. In Proc. 5th OWLED, 2008.     Abstract     BIB     PDF
     
  8. E. Jiménez-Ruiz, B. Cuenca Grau, U. Sattler, T. Schneider, and R. Berlanga Llavori: ProSÉ:  A Protégé plugin for Reusing Ontologies, Safe and Économique. JISBD 2008, pg. 449–452, 2008.
     
  9. M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer: The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. In Proc. M4M-5, ENTCS 231, pg 277–292, 2009.     Abstract     BIB     DOI     Extended PDF
     
  10. E. Jiménez-Ruiz, B. Cuenca Grau, U. Sattler, T. Schneider, and R. Berlanga Llavori: Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. In Proc. of ESWC 2008, LNCS 5021, pg. 185–199, 2008. Nominated for Best Paper Award.     Abstract     BIB     DOI     Extended and corrected PDF
     
  11. E. Jiménez-Ruiz, B. Cuenca Grau, U. Sattler, T. Schneider, and R. Berlanga Llavori: Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. In Proc. 21st DL, 2008.     Abstract     BIB     PDF     Extended PDF
     
  12. E. Jiménez-Ruiz, B. Cuenca Grau, U. Sattler, T. Schneider, and R. Berlanga Llavori: Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. In Proc. 4th OWLED, 2008.     Abstract     BIB     PDF     Extended PDF
     
  13. Superseded by Article 3:     M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. In Proc. 10th FoSSaCS, LNCS 4423, pg. 48–62, Springer, 2007.
     
  14. Superseded by Article 4:     M. Mundhenk, T. Schneider: The Complexity of Hybrid Logics over Equivalence Relations. In Proc. HyLo 2007, pg. 81–90.
     
  15. M. Mundhenk, T. Schneider: Undecidability of Multi-modal Hybrid Logics. In Proc. HyLo 2006, ENTCS 174(6), pg. 29–43, Elsevier, 2007.     Abstract     BIB     PDF     Extended PDF
     
  16. Superseded by Article 2:     M. Mundhenk, T. Schneider, T. Schwentick, V. Weber: Complexity of Hybrid Logics over Transitive Frames. In Proc. M4M-4, Informatik-Berichte 194 (2005), 62–78.     Abstract     BIB     PDF     Extended PDF
     

Theses

T. Schneider: The Complexity of Hybrid Logics over Restricted Frame Classes. PhD dissertation, Friedrich-Schiller-Universität Jena, July 2007. Cuvillier Verlag, Göttingen.     Zusammenfassung     Abstract     BIB     PDF

T. Schneider: Komplexität modaler Logiken. (Complexity of Modal Logics.) Diplomarbeit, Friedrich-Schiller-Universität Jena, 2002, 65 pages, in German.     Zusammenfassung     Abstract     BIB     PDF

Reports

  1. Chiara Del Vescovo, B. Parsia, U. Sattler, and T. Schneider: The modular structure of an ontology: an empirical study. Technical Report, University of Manchester, 2010.     Abstract     PDF
    This report is an extended version of Paper 5.
     
  2. U. Sattler, T. Schneider, and M. Zakharyaschev: Which Kind of Module Should I Extract? Technical Report, University of Manchester, 2009.     Abstract     PDF
    This report is an extended and corrected version of Paper 8.
     
  3. E. Jiménez-Ruiz, B. Cuenca Grau, U. Sattler, T. Schneider, and R. Berlanga Llavori: Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. Technical Report, University of Manchester, 2007.     Abstract     PDF
    This report is an extended and corrected version of Paper 14.
     
  4. M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer: The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Technical Report 07-04, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2007.     Abstract     PDF
    This report is an extended version of Paper 13.
     
  5. M. Mundhenk, T. Schneider: The Complexity of Hybrid Logics over Equivalence Relations. Technical Report 07-02, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2007.     Abstract     PDF
    This report is an extended version of Paper 18, which is superseded by Article 4.
     
  6. M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. Report TR06-153, ECCC, 2006.    Abstract     PDF
    This report is an extended version of Paper 17, which is superseded by Article 3.
     
  7. M. Mundhenk, T. Schneider: Undecidability of Multi-modal Hybrid Logics. Technical Report 06-11, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2006.     Abstract     PDF
    This report improves on Theorem 3.2 in Paper 19.
     

Valid HTML 4.01 Transitional     Valid CSS!     10 Oct 2009     Thomas Schneider     Back     Visits since 2 Oct 2007:     gratis Counter by GOWEB Gratis Counter by GOWEB