Jean Christoph Jung
36 publications
9 venues
H Index 12
Affiliation
Technical University of Dortmund, Department of Computer Science, GermanyUniversity of Bremen, Institute of Computer Science, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Revisiting Conjunctive Query Entailment for S.
|
AAAI | 2026 | 0 |
| Fitting Ontologies and Constraints to Relational Structures.
|
KR | 2025 | 1 |
| Temporal Conjunctive Query Answering via Rewriting.
|
AAAI | 2025 | 1 |
| SAT-Based Bounded Fitting for the Description Logic
|
ISWC | 2025 | 0 |
| Extremal Separation Problems for Temporal Instance Queries.
|
IJCAI | 2024 | 2 |
| Unique Characterisability and Learnability of Temporal Queries Mediated by an Ontology.
|
KR | 2024 | 0 |
| Answering regular path queries mediated by unrestricted SQ ontologies.
|
Artificial Intelligence | 2023 | 4 |
| SAT-Based PAC Learning of Description Logic Concepts.
|
IJCAI | 2023 | 14 |
| Conservative Extensions for Existential Rules.
|
KR | 2022 | 1 |
| QBF Programming with the Modeling Language Bule.
|
SAT | 2022 | 2 |
| Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies.
|
IJCAI | 2022 | 13 |
| Logical separability of labeled data examples under ontologies.
|
Artificial Intelligence | 2022 | 0 |
| Separating Data Examples by Description Logic Concepts with Restricted Signatures.
|
KR | 2021 | 19 |
| Living Without Beth and Craig: Definitions and Interpolants in Description Logics with Nominals and Role Inclusions.
|
AAAI | 2021 | 8 |
| Actively Learning Concepts and Conjunctive Queries under ELr-Ontologies.
|
IJCAI | 2021 | 8 |
| Least General Generalizations in Description Logic: Verification and Existence.
|
AAAI | 2020 | 22 |
| On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions.
|
KR | 2020 | 5 |
| Logical Separability of Incomplete Data under Ontologies.
|
KR | 2020 | 23 |
| Conservative Extensions in Horn Description Logics with Inverse Roles.
|
JAIR | 2020 | 10 |
| Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming.
|
CIKM | 2019 | 6 |
| On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles.
|
IJCAI | 2019 | 10 |
| Learning Description Logic Concepts: When can Positive and Negative Examples be Separated?.
|
IJCAI | 2019 | 0 |
| Answering Regular Path Queries over SQ Ontologies.
|
AAAI | 2018 | 9 |
| Reverse Engineering Queries in Ontology-Enriched Systems: The Case of Expressive Horn Description Logic Ontologies.
|
IJCAI | 2018 | 37 |
| Quantified Markov Logic Networks.
|
KR | 2018 | 2 |
| Number Restrictions on Transitive Roles in Description Logics with Nominals.
|
AAAI | 2017 | 10 |
| Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage.
|
IJCAI | 2017 | 0 |
| Query Conservative Extensions in Horn Description Logics with Inverse Roles.
|
IJCAI | 2017 | 3 |
| Probabilistic Description Logics for Subjective Uncertainty.
|
JAIR | 2017 | 0 |
| Temporalized EL Ontologies for Accessing Temporal Data: Complexity of Atomic Queries.
|
IJCAI | 2016 | 34 |
| On Metric Temporal Description Logics.
|
ECAI | 2016 | 43 |
| Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes.
|
IJCAI | 2015 | 19 |
| Lightweight Description Logics and Branching Time: A Troublesome Marriage.
|
KR | 2014 | 25 |
| Complexity of Branching Temporal Description Logics.
|
ECAI | 2012 | 21 |
| Ontology-Based Access to Probabilistic Data with OWL QL.
|
ISWC | 2012 | 0 |
| A Closer Look at the Probabilistic Description Logic Prob-EL.
|
AAAI | 2011 | 24 |