Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Schneider 0002
Person information
- affiliation: University of Bremen, Faculty of Mathematics, Computer Science, Germany
- affiliation: University of Jena, Department of Computer Science, Germany
- affiliation: University of Manchester, School of Computer Science, UK
Other persons with the same name
- Thomas Schneider — disambiguation page
- Thomas Schneider 0001
![[0000-0003-1126-2818]](https://dblp1.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, Germany
- Thomas Schneider 0006 — Darmstadt University of Technology, Institute of Microelectronic Systems, Germany
- Thomas Schneider 0007 — ETH Zurich, Switzerland
- Thomas Schneider 0008 — Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
- Thomas Schneider 0009 — University of Trier, Germany
- Thomas Schneider 0010 — TU Braunschweig, Germany (and 2 more)
- Thomas Schneider 0011 — Siemens
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 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
Journal Articles
- 2020
- [j16]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Conservative Extensions in Horn Description Logics with Inverse Roles. J. Artif. Intell. Res. 68: 365-411 (2020) - [j15]Chiara Del Vescovo, Matthew Horridge, Bijan Parsia, Uli Sattler, Thomas Schneider, Haoruo Zhao:
Modular Structures and Atomic Decomposition in Ontologies. J. Artif. Intell. Res. 69: 963-1021 (2020) - [j14]Thomas Schneider, Mantas Simkus:
Special Issue on Ontologies and Data Management: Part I. Künstliche Intell. 34(3): 287-289 (2020) - [j13]Thomas Schneider, Mantas Simkus:
Ontologies and Data Management: A Brief Survey. Künstliche Intell. 34(3): 329-353 (2020) - [j12]Uli Sattler, Thomas Schneider:
Interview with Uli Sattler. Künstliche Intell. 34(3): 429-432 (2020) - [j11]Thomas Schneider, Mantas Simkus:
Special Issue on Ontologies and Data Management: Part II. Künstliche Intell. 34(4): 439-441 (2020) - 2019
- [j10]Sven Schewe, Thomas Schneider, Jef Wijsen:
Special issue on Temporal Representation and Reasoning (TIME 2017). Theor. Comput. Sci. 797: 1 (2019) - 2017
- [j9]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) - 2013
- [j8]Arne Meier, Thomas Schneider:
Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 505: 55-73 (2013) - 2011
- [j7]Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer:
Model Checking CTL is Almost Always Inherently Sequential. Log. Methods Comput. Sci. 7(2) (2011) - [j6]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. J. Am. Medical Informatics Assoc. 18(4): 432-440 (2011) - [j5]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) - 2010
- [j4]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. 8(4): 409-421 (2010) - [j3]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of hybrid logics over transitive frames. J. Appl. Log. 8(4): 422-440 (2010) - 2009
- [j2]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Log. Methods Comput. Sci. 5(1) (2009) - [j1]Martin Mundhenk, Thomas Schneider:
The Complexity of Hybrid Logics over Equivalence Relations. J. Log. Lang. Inf. 18(4): 493-514 (2009)
Conference and Workshop Papers
- 2021
- [c43]Robin Nolte, Thomas Schneider:
Properties of Module Notions and Atomic Decomposition (Extended Abstract). Description Logics 2021 - [c42]Robin Nolte, Thomas Schneider:
Properties of Module Notions and Atomic Decomposition. KR 2021: 497-507 - 2019
- [c41]Reinhard Moratz, Leif Sabellek, Thomas Schneider:
Granular Spatial Calculi of Relative Directions or Movements with Parallelism: Consistent Account (Short Paper). COSIT 2019: 28:1-28:9 - [c40]Robin Nolte, Thomas Schneider:
How Modular Are Modular Ontologies? Logic-Based Metrics for Ontologies with Imports. Description Logics 2019 - 2018
- [c39]Sascha Jongebloed, Thomas Schneider:
Ontology Partitioning Using E-Connections Revisited. Description Logics 2018 - [c38]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Querying the Unary Negation Fragment with Regular Path Expressions. ICDT 2018: 15:1-15:18 - [c37]Sascha Jongebloed, Thomas Schneider:
Ontology Partitioning Using E-Connections Revisited (Extended Abstract). MedRACER+WOMoCoE@KR 2018: 63-66 - 2017
- [c36]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 - [c35]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Query Conservative Extensions in Horn Description Logics with Inverse Roles. IJCAI 2017: 1116-1122 - 2015
- [c34]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 - [c33]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
- [c32]Yazmín Angélica Ibáñez-García, Carsten Lutz, Thomas Schneider:
Finite Model Reasoning in Horn Description Logics. KR 2014 - [c31]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Thomas Schneider:
Lightweight Description Logics and Branching Time: A Troublesome Marriage. KR 2014 - 2013
- [c30]Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter:
Algebraic Properties of Qualitative Spatio-temporal Calculi. COSIT 2013: 516-536 - [c29]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 - [c28]Yazmín Angélica Ibáñez-García, Carsten Lutz, Thomas Schneider:
Finite Model Reasoning in Horn-SHIQ. Description Logics 2013: 234-245 - [c27]Chiara Del Vescovo, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider, Dmitry Tsarkov:
Empirical Study of Logic-Based Modules: Cheap Is Cheerful. ISWC (1) 2013: 84-100 - 2012
- [c26]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 - [c25]Pavel Klinov, Chiara Del Vescovo, Thomas Schneider:
Incrementally Updateable and Persistent Decomposition of OWL Ontologies. OWLED 2012 - [c24]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 - 2011
- [c23]Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider, Frank Wolter, Michael Zakharyaschev:
Conjunctive Query Inseparability of OWL 2 QL TBoxes. AAAI 2011: 221-226 - [c22]Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider, Frank Wolter, Michael Zakharyaschev:
Module Extraction via Query Inseparability in OWL 2 QL. Description Logics 2011 - [c21]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The Modular Structure of an Ontology: Atomic Decomposition. IJCAI 2011: 2232-2237 - [c20]Chiara Del Vescovo, Damian Gessler, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider, Andrew Winget:
Decomposition and Modular Structure of BioPortal Ontologies. ISWC (1) 2011: 130-145 - [c19]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 - [c18]Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). TAMC 2011: 552-562 - [c17]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The Modular Structure of an Ontology: Atomic Decomposition and Module Count. WoMO 2011: 25-39 - 2010
- [c16]Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Description Logics 2010 - [c15]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The modular structure of an ontology: an empirical study. Description Logics 2010 - [c14]Bijan Parsia, Thomas Schneider:
The Modular Structure of an Ontology: An Empirical Study. KR 2010 - [c13]Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider:
The modular structure of an ontology: an empirical study. WoMO 2010: 11-24 - 2009
- [c12]Ulrike Sattler, Thomas Schneider, Michael Zakharyaschev:
Which Kind of Module Should I Extract? Description Logics 2009 - [c11]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 - [c10]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 - [c9]Bijan Parsia, Ulrike Sattler, Thomas Schneider:
Mechanisms for Importing Modules. OWLED 2009 - [c8]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28 - 2008
- [c7]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 - [c6]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 - [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. OWLED (Spring) 2008 - [c4]Bijan Parsia, Ulrike Sattler, Thomas Schneider:
Easy Keys for OWL. OWLED 2008 - 2007
- [c3]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62 - [c2]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. M4M 2007: 277-292 - 2006
- [c1]Martin Mundhenk, Thomas Schneider:
Undecidability of Multi-modal Hybrid Logics. HyLo@FLoC 2006: 29-43
Editorship
- 2018
- [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
- [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 für Informatik 2017, ISBN 978-3-95977-052-1 [contents] - 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] - 2011
- [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]
Informal and Other Publications
- 2020
- [i13]Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
Conservative Extensions in Horn Description Logics with Inverse Roles. CoRR abs/2011.09858 (2020) - 2017
- [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) - 2013
- [i10]Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter:
Algebraic Properties of Qualitative Spatio-Temporal Calculi. CoRR abs/1305.7345 (2013) - 2012
- [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
- [i7]Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC. CoRR abs/1103.0853 (2011) - 2010
- [i6]Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. CoRR abs/1001.4255 (2010) - 2009
- [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
- [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. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [i1]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
Ulrike Sattler
aka: Uli Sattler
aka: Uli Sattler
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-17 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
