Follow
Thomas Schneider
Thomas Schneider
Dept. of Mathematics and Computer Science, University of Bremen, Germany
Verified email at uni-bremen.de - Homepage
Title
Cited by
Cited by
Year
Safe and economic re-use of ontologies: A logic-based methodology and tool support
E Jiménez-Ruiz, B Grau, U Sattler, T Schneider, R Berlanga
The Semantic Web: Research and Applications, 185-199, 2008
1632008
Getting the foot out of the pelvis: modeling problems affecting use of SNOMED CT hierarchies in practical applications
AL Rector, S Brandt, T Schneider
Journal of the American Medical Informatics Association 18 (4), 432-440, 2011
1222011
Which kind of module should I extract
U Sattler, T Schneider, M Zakharyaschev
Proc. of DL 477, 2009
1212009
The modular structure of an ontology: Atomic decomposition
C Del Vescovo, B Parsia, U Sattler, T Schneider
IJCAI Proceedings-international joint conference on artificial intelligence …, 2011
1112011
A survey of qualitative spatial and temporal calculi: algebraic and computational properties
F Dylla, JH Lee, T Mossakowski, T Schneider, A van Delden, ...
ACM Computing Surveys (CSUR) 50 (1), 1-39, 2017
1092017
Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers.
R Kontchakov, L Pulina, U Sattler, T Schneider, P Selmer, F Wolter, ...
IJCAI 9, 836-841, 2009
1012009
Decomposition and modular structure of BioPortal ontologies
C Del Vescovo, D Gessler, P Klinov, B Parsia, U Sattler, T Schneider, ...
The Semantic Web–ISWC 2011, 130-145, 2011
582011
Algebraic Properties of Qualitative Spatio-Temporal Calculi
F Dylla, T Mossakowski, T Schneider, D Wolter
COSIT, 516-536, 2013
502013
The modular structure of an ontology: an empirical study
C Del Vescovo, B Parsia, U Sattler, T Schneider
Proceedings of the Fourth International Workshop on Modular Ontologies (WoMO …, 2010
402010
Ontologies and data management: a brief survey
T Schneider, M Šimkus
KI-Künstliche Intelligenz 34 (3), 329-353, 2020
382020
The complexity of generalized satisfiability for linear temporal logic
M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer
Logical Methods in Computer Science 5 (1), 2008
382008
Empirical Study of Logic-Based Modules: Cheap Is Cheerful
C Del Vescovo, P Klinov, B Parsia, U Sattler, T Schneider, D Tsarkov
Description Logics, 144-155, 2013
342013
Finite Model Reasoning in Horn Description Logics
Y Ibáñez-García, C Lutz, T Schneider
KR-2014, 2014
302014
Lightweight Description Logics and Branching Time: a Troublesome Marriage
V Gutiérrez-Basulto, JC Jung, T Schneider
KR-2014, 2014
302014
Conjunctive query inseparability of OWL 2 QL TBoxes
B Konev, R Kontchakov, M Ludwig, T Schneider, F Wolter, ...
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 221-226, 2011
292011
Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes
V Gutiérrez-Basulto, JC Jung, T Schneider
IJCAI, 3015-3021, 2015
272015
Complexity of hybrid logics over transitive frames
M Mundhenk, T Schneider, T Schwentick, V Weber
Journal of Applied Logic 8 (4), 422-440, 2010
272010
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer
ACM Transactions on Computational Logic (TOCL) 12 (2), 1-28, 2011
252011
The tractability of model-checking for LTL: The good, the bad, and the ugly fragments
M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer
Electronic Notes in Theoretical Computer Science 231, 277-292, 2009
242009
The complexity of generalized satisfiability for linear temporal logic
M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer
Foundations of Software Science and Computational Structures: 10th …, 2007
242007
The system can't perform the operation now. Try again later.
Articles 1–20