J
Jean Christoph Jung
Researcher at University of Bremen
Publications - 70
Citations - 528
Jean Christoph Jung is an academic researcher from University of Bremen. The author has contributed to research in topics: Description logic & Decidability. The author has an hindex of 12, co-authored 59 publications receiving 424 citations. Previous affiliations of Jean Christoph Jung include Katholieke Universiteit Leuven & University of Hildesheim.
Papers
More filters
Book ChapterDOI
Ontology-based access to probabilistic data with OWL QL
Jean Christoph Jung,Carsten Lutz +1 more
TL;DR: A framework for querying probabilistic instance data in the presence of an OWL2 QL ontology is proposed, arguing that the interplay of probabilities and ontologies is fruitful in many applications such as managing data that was extracted from the web.
Proceedings ArticleDOI
On metric temporal description logics
TL;DR: Algorithms and tight complexity bounds for the satisfiability problem in mTDLs based on (fragments of) LTLbin are established and complexity bounds ranging from EXPTIME to 2EXPSPACE are established.
Proceedings Article
Temporalized EL ontologies for accessing temporal data: complexity of atomic queries
TL;DR: The main contributions are a semantic and sufficient syntactic conditions for decidability and three orthogonal tractable fragments, which are based on restricted use of rigid roles, temporal operators, and novel acyclicity conditions on the ontologies.
Proceedings ArticleDOI
Reverse Engineering Queries in Ontology-Enriched Systems: The Case of Expressive Horn Description Logic Ontologies
TL;DR: The query-by-example (QBE) paradigm for query answering in the presence of ontologies with characterizations, algorithms and tight complexity bounds for QBE are introduced.
Proceedings Article
Lightweight description logics and branching time: a troublesome marriage
TL;DR: This paper investigates BTDLs that emerge from combining fragments of CTL with lightweight DLs from the EL and DL-Lite families, and identifies two convex fragments which are undecidable and hard for non-elementary time, respectively.