|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 8 keywords
|
|
|
|
|
Results
Found 39 publication records. Showing 39 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Felix Weiss |
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Arne Meier, Thomas Schneider 0002 |
Generalized Satisfiability for the Description Logic ALC  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Heribert Vollmer |
Model Checking CTL is Almost Always Inherently Sequential  |
Logical Methods in Computer Science  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, 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.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Rector, Sam Brandt, Thomas Schneider 0002 |
Getting the foot out of the pelvis: modeling problems affecting use of SNOMED CT hierarchies in practical applications.  |
JAMIA  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002 |
The Modular Structure of an Ontology: Atomic Decomposition.  |
IJCAI  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arne Meier, Thomas Schneider 0002 |
Generalized Satisfiability for the Description Logic ALC\mathcal{ALC} - (Extended Abstract).  |
TAMC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider 0002, Frank Wolter, Michael Zakharyaschev |
Module Extraction via Query Inseparability in OWL 2 QL.  |
Description Logics  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kutz, Thomas Schneider 0002 (eds.) |
Modular Ontologies - Proceedings of the Fifth International Workshop, WoMO 2011, Ljubljana, Slovenia, August 2011  |
WoMO  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002 |
The Modular Structure of an Ontology: Atomic Decomposition and Module Count.  |
WoMO  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Kaminski, Thomas Schneider 0002, Gert Smolka |
Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics.  |
TABLEAUX  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chiara Del Vescovo, Damian Gessler, Pavel Klinov, Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002, Andrew Winget |
Decomposition and Modular Structure of BioPortal Ontologies.  |
International Semantic Web Conference  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider 0002, Frank Wolter, Michael Zakharyaschev |
Conjunctive Query Inseparability of OWL 2 QL TBoxes.  |
AAAI  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002, Thomas Schwentick, Volker Weber |
Complexity of hybrid logics over transitive frames.  |
J. Applied Logic  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss |
The complexity of satisfiability for fragments of hybrid logic - Part I.  |
J. Applied Logic  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Thomas Schneider 0002 |
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Arne Meier, Thomas Schneider 0002 |
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC.  |
Description Logics  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002 |
The modular structure of an ontology: an empirical study.  |
Description Logics  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002 |
The modular structure of an ontology: an empirical study.  |
WoMO  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bijan Parsia, Thomas Schneider 0002 |
The Modular Structure of an Ontology: An Empirical Study.  |
KR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, 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.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002 |
The Complexity of Hybrid Logics over Equivalence Relations.  |
Journal of Logic, Language and Information  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss |
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic  |
Logical Methods in Computer Science  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider 0002 |
Model Checking CTL is Almost Always Inherently Sequential.  |
TIME  |
2009 |
DBLP DOI BibTeX RDF |
Model checking, complexity, temporal logic |
| 1 | Roman Kontchakov, Luca Pulina, Ulrike Sattler, Thomas Schneider 0002, Petra Selmer, Frank Wolter, Michael Zakharyaschev |
Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers.  |
IJCAI  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ulrike Sattler, Thomas Schneider 0002, Michael Zakharyaschev |
Which Kind of Module Should I Extract?  |
Description Logics  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss |
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.  |
MFCS  |
2009 |
DBLP DOI BibTeX RDF |
Post’s lattice, complexity, satisfiability, decidability, hybrid logic |
| 1 | Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002 |
Mechanisms for Importing Modules.  |
OWLED  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, 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)  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002, Thomas Schwentick, Volker Weber |
Complexity of Hybrid Logics over Transitive Frames  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau, Ulrike Sattler, Thomas Schneider 0002, Rafael Berlanga Llavori |
Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support.  |
ESWC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau, Ulrike Sattler, Thomas Schneider 0002, Rafael Berlanga Llavori |
Safe and Economic Re-Use of Ontologies: A Logic-Based Methodology and Tool Support.  |
Description Logics  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bijan Parsia, Ulrike Sattler, Thomas Schneider 0002 |
Easy Keys for OWL.  |
OWLED  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Thomas Schneider 0002 |
The complexity of hybrid logics over restricted frame classes.  |
|
2007 |
RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002 |
Undecidability of Multi-modal Hybrid Logics.  |
Electr. Notes Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic.  |
FoSSaCS  |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, linear temporal logic |
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
Displaying result #1 - #39 of 39 (100 per page; Change: )
|
|