DL 2025
Description Logics 2025

Table of Contents

• Preface
  Summary: There were 51 papers submitted for peer-review to this workshop. Out of these, 50 papers were accepted for this volume, 19 as regular papers and 31 as extended abstracts.

Invited Talks

• On Knowledge Base Embeddings
  Ana Ozaki,
• What It’s Like to Be a Database Theorist in the Land of Multisets
  Jerzy Marcinkowski,
• The Actual Weight of Lightweight Description Logics
  Diego Calvanese

Full Papers

• Towards Conceptual Clustering in EL with Simulation Graphs
  Ruud van Bakel, Michael Cochez, Patrick Koopmann
• The ontocomc ontology: A Semantic Framework for Hindemith’s Harmonic System
  Thanasis Apostolopoulos, Spyridon Kantarelis, Giorgos Stamou
• Backward/Forward with Marking for Update Streams
  Moritz Illich, Birte Glimm
• Computation of Interpolants for Description Logic Concepts in Hard Cases
  Jean Christoph Jung, Jedrzej Kolodziejski, Frank Wolter
• Extending Description Logics with Generic Concepts – the Case of Terminologies
  Joshua Hirschbrunn, Yevgeny Kazakov
• Why not? Developing ABox Abduction beyond Repairs
  Anselm Haak, Patrick Koopmann, Yasir Mahmood, Anni-Yasmin Turhan
• Reliable Reference for a DL Knowledge Base under Data Update
  Enamul Haque, David Toman, Grant Weddell
• Around unification in FL\_bottom -- three related problems
  Sławomir Kost, Barbara Morawska
• CATS Solver: The Rise of Hybrid Abduction Algorithms
  Jakub Kloc, Janka Boborová, Martin Homola, Júlia Pukancová
• Can Full Set-Theoretical Subsumption Semantics in Metamodelled Description Logics Be Captured Within Decidable FOL Fragments?
  Zekeri Adams, Martin Homola, Ján Kl'Uka
• Structural Equality Generating Dependencies and Definite Descriptions
  David Toman, Grant Weddell
• Two Types of Definite Descriptions: Theory and Implementation
  Michal Sochański, Przemysław Andrzej Wałęga, Michal Zawidzki
• Query Rewriting for Nested Navigational Queries over Property Graphs
  Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
• Description Logics with Epsilon Individuals
  Anders Søberg, Martin Giese, Egor V. Kostylev
• The Shape of ℰℒ Proofs: A Tale of Three Calculi
  Christian Alrabbaa, Stefan Borgwardt, Philipp Herrmann, Markus Krötzsch
• Complexity of containment for conjunctive LTL queries
  Jean Christoph Jung, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
• SHACL Satisfiability: What Can We Learn from DLs?
  Anouk Michelle Oudshoorn
• Abductive Differences of Quantified ABoxes
  Francesco Kriegel
• Using Trémaux Trees to Compute Small Conjunctive Queries that Separate Positive and Negative Examples
  Francesco Kriegel
• Accessing Semistructured Data with KGs and LLMs
  Shikhat Karkee, Elena Botoeva, Sam Coombes, Anna Jordanous, Özgür Kafali, Davide Lanti

Extended Abstracts

# The following are examples of papers without page numbers

• Testing Description Logic Reasoners (Extended Abstract)
  Tobias John, Einar Broch Johnsen, Eduard Kamburjan, Dominic Steinhöfel
• Real-world Assessment of Policy-Protected OBDA (Extended Abstract)
  Divya Baura, Diego Calvanese
• Inconsistency Handling in DatalogMTL (Extended Abstract)
  Meghyn Bienvenu, Camille Bourgaux, Atefe Khodadaditaghanaki
• Restricted Chase Termination: You Want More than Fairness (Extended Abstract)
  David Carral, Lukas Gerlach, Lucas Larroque, Michaël Thomazo
• Can You Tell the Difference? Contrastive Explanations for ABox Entailments (Extended Abstract)
  Patrick Koopmann, Yasir Mahmood, Axel-Cyrille Ngonga Ngomo
• On Homogeneous Models of Fluted Languages (Extended Abstract)
  Daumantas Kojelis
• Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Abstract)
  Bartosz Bednarczyk, Emanuel Kieroński
• SAT-Based Bounded Fitting for the Description Logic ALC (Extended Abstract)
  Maurice Funk, Jean Christoph Jung, Tom Voellmer
• Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics (Extended Abstract)
  Meghyn Bienvenu, Quentin Manière
• Minimal Model Reasoning in Description Logics: Don't Try This at Home! (Extended Abstract)
  Federica Di Stefano, Quentin Manière, Magdalena Ortiz, Mantas Šimkus
• A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases (Extended Abstract)
  Meghyn Bienvenu, Camille Bourgaux, Katsumi Inoue, Robin Jean
• Tractable Responsibility Measures for Ontology-Mediated Query Answering (Extended Abstract)
  Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
• Fitting Description Logic Ontologies to ABox and Query Examples (Extended Abstract)
  Maurice Funk, Marvin Grosser, Carsten Lutz
• Fitting Ontologies and Constraints to Relational Structures (Extended Abstract)
  Simon Hosemann, Jean Christoph Jung, Carsten Lutz, Sebastian Rudolph
• The Concrete Evonne: Visualization Meets Concrete Domain Reasoning (Extended Abstract)
  Christian Alrabbaa, Franz Baader, Raimund Dachselt, Alisa Kovtunova, Julián Méndez
• Automated Planning with Ontologies under Coherence Update Semantics (Extended Abstract)
  Stefan Borgwardt, Duy Nhu, Gabriele Röger
• Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Abstract)
  Franz Baader, Stefan Borgwardt, Filippo De Bortoli, Patrick Koopmann
• Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count (Extended Abstract)
  Franz Baader, Anton Claußnitzer
• PAC Learning of Concept Inclusions for Ontology- Mediated Query Answering (Extended Abstract)
  Sergei Obiedkov, Barış Sertkaya
• On the Way to Diverse Datasets for Evaluating ABox Abduction Algorithms (Extended Abstract)
  Janka Boborová, Jakub Kloc, Martin Homola, Júlia Pukancová
• Logic-based Semantics and Query Entailment for RDFS Knowledge Graphs (Extended Abstract)
  Roberto Maria Delfino, Maurizio Lenzerini, Antonella Poggi
• FILO: unification solver for FL_0 (Extended Abstract)
  Barbara Morawska, Dariusz Marzec, Sławomir Kost, Michał Henne
• Analysing Temporal Reasoning in Description Logics Using Formal Grammars (Extended Abstract)
  Camille Bourgaux, Anton Gnatenko, Michaël Thomazo
• Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable (Extended Abstract)
  David Carral, Lucas Larroque, Michaël Thomazo
• Very Expressive Description Logics with Rich yet Affordable Numeric Constraints (Extended Abstract)
  Federica Di Stefano, Sanja Lukumbuzya, Magdalena Ortiz, Mantas Šimkus
• Controlled Query Evaluation with Epistemic Dependencies: Algorithms and Experiments (Extended Abstract)
  Lorenzo Marconi, Flavia Ricci, Riccardo Rosati
• Answering Expressive Conjunctive Queries over RDFS Knowledge Bases (Extended Abstract)
  Gianluca Cima, Marco Console, Roberto Maria Delfino, Maurizio Lenzerini, Antonella Poggi
• Towards Practicable Defeasible Reasoning for ABoxes (Extended Abstract)
  Jonas Philipp Haldimann, Magdalena Ortiz, Mantas Šimkus
• No Cliques Allowed: The Next Step Towards BDD/FC Conjecture (Extended Abstract)
  Lucas Larroque, Piotr Ostropolski-Nalewaja, Michaël Thomazo
• Beyond Optimal: Interactive Identification of Better-than-optimal Repairs (Extended Abstract)
  Francesco Kriegel
• Reasoning in OWL 2 EL with Hierarchical Concrete Domains (Extended Abstract)
  Francesco Kriegel