Thomas Schneider's Publications

My Google Scholar and DBLP profiles – for additional information and disambiguation


Journal Articles

  1. F. Dylla, J. H. Lee, T. Mossakowski, T. Schneider, A. van Delden, J. van de Ven and Diedrich Wolter: A Survey of Qualitative Spatial and Temporal Calculi — Algebraic and Computational Properties. ACM Computing Surveys (CSUR), 50(1), 7:1–7:39, 2017.
    Abstract+PDF+Appendix (ACM DL)    BIB
     
  2. A. Meier and T. Schneider: Generalized Satisfiability for the Description Logic ALC. Theoretical Computer Science, 505, 55–73, 2013.
    Abstract+PDF (ScienceDirect)    BIB
    This is an extension of the conference paper 30.
     
  3. O. Beyersdorff, A. Meier, M. Mundhenk, T. Schneider, M. Thomas, and H. Vollmer: Model Checking CTL is Almost Always Inherently Sequential. Logical Methods in Computer Science, 7(2), 2011.
    Abstract    PDF    BIB
    This is an extended version of the TIME paper 38.
     
  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. ACM Transactions on Computational Logic, 12(2), 2011.
    Abstract+PDF (ACM DL)    BIB
    This is an extended version of the M4M paper 42.
     
  5. A. Rector, S. Brandt, and T. Schneider: Getting the foot out of the pelvis: modeling problems affecting use of SNOMED CT hierarchies in practical applications. JAMIA, 18(4), 432–440, 2011.
    Abstract+PDF (JAMIA)    BIB
     
  6. A. Meier, M. Mundhenk, T. Schneider, M. Thomas, V. Weber, and F. Weiß: The Complexity of Satisfiability for Fragments of Hybrid Logic — Part I. Journal of Applied Logic, 8, 409–421, 2010.
    Abstract+PDF (ScienceDirect)    BIB
    This is an extended version of the MFCS paper 36.
     
  7. M. Mundhenk, T. Schneider, T. Schwentick, V. Weber: Complexity of Hybrid Logics over Transitive Frames. Journal of Applied Logic, 8, 422–440, 2010.
    Abstract+PDF (ScienceDirect)    BIB
    This is an extended version of the M4M paper 49.
     
  8. 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    PDF    BIB
    This is an extended version of the FoSSaCS paper 46.
     
  9. M. Mundhenk, T. Schneider: The Complexity of Hybrid Logics over Equivalence Relations. Journal of Logic, Language and Information, 18(4), 493–514, 2009.
    Abstract+PDF (SpringerLink)    BIB
    This is an extended version of the HyLo paper 47.

Reviewed Conference and Workshop Papers

  1. J. C. Jung, C. Lutz, M. Martel, and T. Schneider: Query Conservative Extensions in Horn Description Logics with Inverse Roles. Accepted for IJCAI 2017.
    Extended PDF
     
  2. J. C. Jung, C. Lutz, M. Martel, T. Schneider, and F. Wolter: Conservative Extensions in Guarded and Two-Variable Fragments. Accepted for ICALP 2017.
    Extended PDF (arXiv.org)
     
  3. V. Gutiérrez-Basulto, J. C. Jung, and T. Schneider: Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes. In Proc. IJCAI 2015, pg. 3015–3021, AAAI Press, 2015.
    BIB    PDF (ijcai.org)    Extended PDF
     
  4. V. Gutiérrez-Basulto, J. C. Jung, and T. Schneider: The Complexity of Temporal Description Logics with Rigid Roles and Restricted TBoxes: In Quest of Saving a Troublesome Marriage. In Proc. 28th DL, vol. 1350 of CEUR, 2015.
    BIB    PDF (CEUR)    Extended PDF
     
  5. L. Sabellek and T. Schneider: A Note on Algebraic Closure and Closure under Constraints. To appear in Proc. of QUAC 2015.
    BIB    PDF
     
  6. Y. Ibáñez-García, C. Lutz, and T. Schneider: Finite Model Reasoning in Horn Description Logics. In Proc. KR 2014, AAAI Press, 2014.
    BIB    PDF (aaai.org)    Extended PDF
     
  7. V. Gutiérrez-Basulto, J. C. Jung, and T. Schneider: Lightweight Description Logics and Branching Time: a Troublesome Marriage. In Proc. KR 2014, AAAI Press, 2014.
    BIB    PDF (aaai.org)    Extended PDF
     
  8. C. Del Vescovo, P. Klinov, B. Parsia, U. Sattler, T. Schneider, and D. Tsarkov: Empirical Study of Logic-Based Modules: Cheap Is Cheerful. In Proc. ISWC 2013 (1), LNCS 8218, pg. 84–100, 2013.
    Extended PDF    BIB    The final publication is available at link.springer.com.
     
  9. F. Dylla, T. Mossakowski, T. Schneider, and D. Wolter: Algebraic Properties of Qualitative Spatio-Temporal Calculi. In Proc. COSIT 2013, LNCS 8116, pg. 516–536, 2013.
    Extended PDF    BIB    The final publication is available at link.springer.com.
     
  10. Y. Ibáñez-García, C. Lutz, and T. Schneider: Finite model reasoning in Horn-SHIQ. In Proc. 26th DL, vol. 1014 of CEUR, 2013.
    PDF (CEUR)    BIB    Extended PDF
     
  11. C. Del Vescovo, P. Klinov, B. Parsia, U. Sattler, T. Schneider, and D. Tsarkov: Empirical Study of Logic-Based Modules: Cheap Is Cheerful. In Proc. 26th DL, vol. 1014 of CEUR, 2013.
    PDF (CEUR)    BIB    Extended PDF
     
  12. S. Göller, A. Meier, M. Mundhenk, T. Schneider, M. Thomas, and F. Weiß: The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. In AiML-9, College Publications, pg. 261–278, 2012.
    BIB    PDF (aiml.net)    Extended version (arXiv):    Abstract    PDF
     
  13. C. Del Vescovo, P. Klinov, B. Parsia, U. Sattler, T. Schneider, and D. Tsarkov: Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation? In Proc. 6th WoMO, vol. 875 of CEUR, 2012.
    PDF (CEUR)    BIB    Extended PDF
     
  14. P. Klinov, C. Del Vescovo, and T. Schneider, Incrementally Updateable and Persistent Decomposition of OWL Ontologies. In Proc. 9th OWLED, vol. 849 of CEUR, 2012.
    PDF (CEUR)    BIB
     
  15. C. Del Vescovo, D. Gessler, P. Klinov, B. Parsia, U. Sattler, T. Schneider, and A. Winget: Decomposition and Modular Structure of BioPortal Ontologies. In Proc. ISWC 2011, LNCS 7031, pg. 130–145, 2011.
    Abstract+PDF (SpringerLink)    Extended PDF    BIB
     
  16. B. Konev, R. Kontchakov, M. Ludwig, T. Schneider, F. Wolter, and M. Zakharyaschev: Module Extraction via Query Inseparability in OWL 2 QL. In Proc. 24th DL, vol. 745 of CEUR, 2011.
    PDF (CEUR)    BIB
     
  17. C. Del Vescovo, B. Parsia, U. Sattler, and T. Schneider: The Modular Structure of an Ontology: Atomic Decomposition and Module Count. In Proc. WoMo 2011, vol. 230 of Frontiers in AI and Appl., pg. 25–39, 2011.
    Abstract    Extended PDF    BIB
     
  18. B. Konev, R. Kontchakov, M. Ludwig, T. Schneider, F. Wolter, and M. Zakharyaschev: Conjunctive Query Inseparability of OWL 2 QL TBoxes. In Proc. AAAI 2011.
    Abstract+PDF (AAAI Press)    Extended PDF    BIB
     
  19. M. Kaminski and T. Schneider and G. Smolka: Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics. In Proc. TABLEAUX 2011, LNCS 6793, pg. 196–210, 2011.
    Abstract+PDF (SpringerLink)    Extended PDF    BIB
     
  20. C. Del Vescovo, B. Parsia, U. Sattler, and T. Schneider: The Modular Structure of an Ontology: Atomic Decomposition. In Proc. IJCAI 2011, pg. 2232–2237, 2011.
    Abstract    PDF (ijcai.org)    Extended PDF    BIB
     
  21. A. Meier and T. Schneider: Generalized Satisfiability for the Description Logic ALC (Extended Abstract). In Proc. TAMC 2011, LNCS 6648, pg. 552–562, 2011.
    Abstract+PDF (SpringerLink)    Extended PDF    BIB
     
  22. B. Parsia and T. Schneider: The Modular Structure of an Ontology: an Empirical Study. In Proc. KR-10, pg. 584–586, 2010.
    Abstract+PDF (AAAI Press)    Extended PDF    BIB
     
  23. C. Del Vescovo, B. Parsia, U. Sattler, and T. Schneider: The Modular Structure of an Ontology: an Empirical Study. In Proc. DL 2010.
    Abstract    PDF (CEUR)    Extended PDF    BIB
     
  24. C. Del Vescovo, B. Parsia, U. Sattler, and T. Schneider: The Modular Structure of an Ontology: an Empirical Study. In Proc. WoMo-10, vol. 211 of Frontiers in AI and Appl., pg. 11–24, 2010.
    Abstract    Extended PDF    BIB
     
  25. A. Meier and T. Schneider: The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. In Proc. DL 2010.
    Abstract    PDF (CEUR)    Extended PDF    BIB
     
  26. B. Parsia, U. Sattler, and T. Schneider: Mechanisms for Importing Modules. In Proc. OWLED, volume 529 of CEUR, 2009.
    Abstract    PDF (CEUR)    BIB
     
  27. Superseded by Article 6:     A. Meier, M. Mundhenk, T. Schneider, M. Thomas V. Weber, and F. Weiß: The Complexity of Satisfiability for Fragments of Hybrid Logic — Part I. In Proc. 34th MFCS, pg. 587–599, 2009.
     
  28. U. Sattler, T. Schneider, and M. Zakharyaschev: Which Kind of Module Should I Extract? In Proc. 22nd DL, 2009.
    Abstract    PDF (CEUR)    Extended PDF    BIB
     
  29. Superseded by Article 3:     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.
     
  30. 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, pg. 836–841, 2009.
    Abstract    PDF (ijcai.org)    BIB
     
  31. B. Parsia, U. Sattler, and T. Schneider: Easy Keys for OWL. In Proc. 5th OWLED, 2008.
    Abstract    PDF (CEUR)    BIB
     
  32. 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.
     
  33. Superseded by Article 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. In Proc. M4M-5, ENTCS 231, pg. 277–292, 2009.
     
  34. 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+PDF (SpringerLink)    Extended and corrected PDF    BIB
     
  35. 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    PDF (CEUR)    Extended PDF    BIB
     
  36. 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    PDF (WebOnt.org)    Extended PDF    BIB
     
  37. Superseded by Article 8:     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.
     
  38. Superseded by Article 9:     M. Mundhenk, T. Schneider: The Complexity of Hybrid Logics over Equivalence Relations. In Proc. HyLo 2007, pg. 81–90.
     
  39. M. Mundhenk, T. Schneider: Undecidability of Multi-modal Hybrid Logics. In Proc. HyLo 2006, ENTCS 174(6), pg. 29–43, Elsevier, 2007.
    Abstract+PDF (ScienceDirect)    Extended PDF    BIB
     
  40. Superseded by Article 7:     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.

Edited proceedings

  1. O. Kutz and T. Schneider: Modular Ontologies – Proceedings of the Fifth International Workshop. Vol. 230 of Frontiers in Artificial Intelligence and Applications, IOS Press 2011.
    BIB    Online version
  2. T. Schneider and D. Walther: Proceedings of the 6th International Workshop on Modular Ontologies. Vol. 875 of CEUR Workshop Proceedings, CEUR-WS.org 2012.
    BIB    Online version

Theses

  1. T. Schneider: Taming Complex Modal and Description Logics. Summary of the cumulative habilitation work, Universität Bremen, October 2015.
    PDF
     
  2. 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    PDF    BIB
     
  3. T. Schneider: Komplexität modaler Logiken. (Complexity of Modal Logics.) Diplom thesis, Friedrich-Schiller-Universität Jena, 2002, 65 pages, in German.
    Zusammenfassung    Abstract    PDF    BIB

Valid HTML 4.01 Transitional Valid CSS!1 July 2017   Thomas Schneider