Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarThomas Schneider 0002
Person information
- affiliation: University of Bremen, Faculty of Mathematics, Computer Science
- affiliation: University of Jena, Department of Computer Science
- affiliation: University of Manchester, School of Computer Science
Other persons with the same name
- Thomas Schneider
- Thomas Schneider 0001
![[0000-0003-1126-2818]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-1126-2818")
— Technical University Munich, Limnological Station Iffeldorf, Germany - Thomas Schneider 0003 — TU Darmstadt, European Center for Security and Privacy by Design, Germany (and 2 more)
- Thomas Schneider 0004 — Vienna University of Technology, Austria
- Thomas Schneider 0005 — SAP AG
- Thomas Schneider 0006 — Darmstadt University of Technology, Institute of Microelectronic Systems
- Thomas Schneider 0007 — ETH Zurich, Switzerland
- Thomas Schneider 0008 — Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[c37]Sascha Jongebloed, Thomas Schneider:
Ontology Partitioning Using E-Connections Revisited. Description Logics 2018- [c36]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Querying the Unary Negation Fragment with Regular Path Expressions. ICDT 2018: 15:1-15:18 - [c35]Sascha Jongebloed, Thomas Schneider:
Ontology Partitioning Using E-Connections Revisited (Extended Abstract). MedRACER+WOMoCoE@KR 2018: 63-66 - [e4]Magdalena Ortiz, Thomas Schneider:
Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to - 29th, 2018. CEUR Workshop Proceedings 2211, CEUR-WS.org 2018 [contents] - 2017
- [j11]Frank Dylla, Jae Hee Lee, Till Mossakowski, Thomas Schneider, André van Delden, Jasper van de Ven, Diedrich Wolter:
A Survey of Qualitative Spatial and Temporal Calculi: Algebraic and Computational Properties. ACM Comput. Surv. 50(1): 7:1-7:39 (2017) - [c34]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider, Frank Wolter:
Conservative Extensions in Guarded and Two-Variable Fragments. ICALP 2017: 108:1-108:14 - [c33]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Query Conservative Extensions in Horn Description Logics with Inverse Roles. IJCAI 2017: 1116-1122 - [e3]Sven Schewe, Thomas Schneider, Jef Wijsen:
24th International Symposium on Temporal Representation and Reasoning, TIME 2017, October 16-18, 2017, Mons, Belgium. LIPIcs 90, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2017, ISBN 978-3-95977-052-1 [contents] - [i12]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider, Frank Wolter:
Conservative Extensions in Guarded and Two-Variable Fragments. CoRR abs/1705.10115 (2017) - 2016
- [i11]Frank Dylla, Jae Hee Lee, Till Mossakowski, Thomas Schneider, André van Delden, Jasper van de Ven, Diedrich Wolter:
A Survey of Qualitative Spatial and Temporal Calculi - Algebraic and Computational Properties. CoRR abs/1606.00133 (2016) - 2015
- [c32]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Thomas Schneider:
The Complexity of Temporal Description Logics with Rigid Roles and Restricted TBoxes: In Quest of Saving a Troublesome Marriage. Description Logics 2015 - [c31]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Thomas Schneider:
Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes. IJCAI 2015: 3015-3021 - 2014
- [c30]Yazmin Angélica Ibáñez-García, Carsten Lutz, Thomas Schneider:
Finite Model Reasoning in Horn Description Logics. KR 2014 - [c29]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Thomas Schneider:
Lightweight Description Logics and Branching Time: A Troublesome Marriage. KR 2014 - 2013
- [j10]Arne Meier, Thomas Schneider:
Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 505: 55-73 (2013) - [c28]Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter:
Algebraic Properties of Qualitative Spatio-temporal Calculi. COSIT 2013: 516-536 - [c27]Chiara Del Vescovo, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider, Dmitry Tsarkov:
Empirical Study of Logic-Based Modules: Cheap Is Cheerful. Description Logics 2013: 144-155 - [c26]Yazmin Angélica Ibáñez-García, Carsten Lutz, Thomas Schneider:
Finite Model Reasoning in Horn-SHIQ. Description Logics 2013: 234-245 - [c25]Chiara Del Vescovo, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider, Dmitry Tsarkov:
Empirical Study of Logic-Based Modules: Cheap Is Cheerful. International Semantic Web Conference (1) 2013: 84-100 - [i10]Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter:
Algebraic Properties of Qualitative Spatio-Temporal Calculi. CoRR abs/1305.7345 (2013) - 2012
- [c24]Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß:
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic 2012: 261-278 - [c23]Pavel Klinov, Chiara Del Vescovo, Thomas Schneider:
Incrementally Updateable and Persistent Decomposition of OWL Ontologies. OWLED 2012 - [c22]Chiara Del Vescovo, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider, Dmitry Tsarkov:
Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation? WoMO 2012 - [e2]Thomas Schneider, Dirk Walther:
Proceedings of the 6th International Workshop on Modular Ontologies, Graz, Austria, July 24, 2012. CEUR Workshop Proceedings 875, CEUR-WS.org 2012 [contents] - [i9]Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss:
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. CoRR abs/1204.1196 (2012) - [i8]Chiara Del Vescovo, Pavel Klinov, Bijan Parsia, Uli Sattler, Thomas Schneider, Dmitry Tsarkov:
Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation? CoRR abs/1207.1641 (2012) - 2011
- [j9]Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer:
Model Checking CTL is Almost Always Inherently Sequential. Logical Methods in Computer Science 7(2) (2011) - [j8]Alan L. Rector, Sam Brandt, Thomas 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) - [j7]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. 12(2): 13:1-13:28 (2011) - [c21]Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider, Frank Wolter, Michael Zakharyaschev:
Conjunctive Query Inseparability of OWL 2 QL TBoxes. AAAI 2011 - [c20]Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider, Frank Wolter, Michael Zakharyaschev:
Module Extraction via Query Inseparability in OWL 2 QL. Description Logics 2011 - [c19]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The Modular Structure of an Ontology: Atomic Decomposition. IJCAI 2011: 2232-2237 - [c18]Chiara Del Vescovo, Damian Gessler, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider, Andrew Winget:
Decomposition and Modular Structure of BioPortal Ontologies. International Semantic Web Conference (1) 2011: 130-145 - [c17]Mark Kaminski, Thomas Schneider, Gert Smolka:
Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics. TABLEAUX 2011: 196-210 - [c16]Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). TAMC 2011: 552-562 - [c15]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The Modular Structure of an Ontology: Atomic Decomposition and Module Count. WoMO 2011: 25-39 - [e1]Oliver Kutz, Thomas Schneider:
Modular Ontologies - Proceedings of the Fifth International Workshop, WoMO 2011, Ljubljana, Slovenia, August 2011. Frontiers in Artificial Intelligence and Applications 230, IOS Press 2011, ISBN 978-1-60750-798-7 [contents] - [i7]Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC. CoRR abs/1103.0853 (2011) - 2010
- [j6]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Applied Logic 8(4): 409-421 (2010) - [j5]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of hybrid logics over transitive frames. J. Applied Logic 8(4): 422-440 (2010) - [c14]Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Description Logics 2010 - [c13]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The modular structure of an ontology: an empirical study. Description Logics 2010 - [c12]
- [c11]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The modular structure of an ontology: an empirical study. WoMO 2010: 11-24 - [i6]Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. CoRR abs/1001.4255 (2010)
2000 – 2009
- 2009
- [j4]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Logical Methods in Computer Science 5(1) (2009) - [j3]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. Electr. Notes Theor. Comput. Sci. 231: 277-292 (2009) - [j2]Martin Mundhenk, Thomas Schneider:
The Complexity of Hybrid Logics over Equivalence Relations. Journal of Logic, Language and Information 18(4): 493-514 (2009) - [c10]Ulrike Sattler, Thomas Schneider, Michael Zakharyaschev:
Which Kind of Module Should I Extract? Description Logics 2009 - [c9]Roman Kontchakov, Luca Pulina, Ulrike Sattler, Thomas Schneider, Petra Selmer, Frank Wolter, Michael Zakharyaschev:
Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers. IJCAI 2009: 836-841 - [c8]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS 2009: 587-599 - [c7]
- [c6]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28 - [i5]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I. CoRR abs/0906.1489 (2009) - 2008
- [c5]Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau, Ulrike Sattler, Thomas Schneider, Rafael Berlanga Llavori:
Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. Description Logics 2008 - [c4]Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau, Ulrike Sattler, Thomas Schneider, Rafael Berlanga Llavori:
Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. ESWC 2008: 185-199 - [c3]Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau, Ulrike Sattler, Thomas Schneider, Rafael Berlanga Llavori:
Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support. OWLED (Spring) 2008 - [c2]
- [i4]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. CoRR abs/0805.0498 (2008) - [i3]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of Hybrid Logics over Transitive Frames. CoRR abs/0806.4130 (2008) - [i2]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electronic Colloquium on Computational Complexity (ECCC) 15(028) (2008) - 2007
- [b1]Thomas Schneider:
The complexity of hybrid logics over restricted frame classes. Friedrich Schiller University of Jena 2007, ISBN 978-3-86727-298-8, pp. 1-108 - [j1]Martin Mundhenk, Thomas Schneider:
Undecidability of Multi-modal Hybrid Logics. Electr. Notes Theor. Comput. Sci. 174(6): 29-43 (2007) - [c1]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62 - 2006
- [i1]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electronic Colloquium on Computational Complexity (ECCC) 13(153) (2006)
Coauthor Index
Ulrike Sattler
aka: Uli Sattler
aka: Uli Sattler
maintained by 
, founded at 
, founded at 
last updated on 2019-02-21 20:54 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
