Accepted papers

  • Francesco Kriegel Abductive Differences of Quantified ABoxes
  • Christian Alrabbaa, Stefan Borgwardt, Philipp Herrmann and Markus Krötzsch The Shape of ℰℒ Proofs: A Tale of Three Calculi
  • Francesco Kriegel Beyond Optimal: Interactive Identification of Better-than-optimal Repairs (Extended Abstract)
  • Patrick Koopmann, Yasir Mahmood and Axel-Cyrille Ngonga Ngomo Can You Tell the Difference? Contrastive Explanations for ABox Entailments (Extended Abstract)
  • Maurice Funk, Jean Christoph Jung and Tom Voellmer SAT-Based Bounded Fitting for the Description Logic ALC (Extended Abstract)
  • Maurice Funk, Marvin Grosser and Carsten Lutz Fitting Description Logic Ontologies to ABox and Query Examples (Extended Abstract)
  • Simon Hosemann, Jean Christoph Jung, Carsten Lutz and Sebastian Rudolph Fitting Ontologies and Constraints to Relational Structures (Extended Abstract)
  • Jean Christoph Jung, Jedrzej Kolodziejski and Frank Wolter Computation of Interpolants for Description Logic Concepts in Hard Cases
  • David Carral, Lukas Gerlach, Lucas Larroque and Michaël Thomazo Restricted Chase Termination: You Want More than Fairness (Extended Abstract)
  • David Carral, Lucas Larroque and Michaël Thomazo Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable (Extended Abstract)
  • Lucas Larroque, Piotr Ostropolski-Nalewaja and Michaël Thomazo No Cliques Allowed: The Next Step Towards BDD/FC Conjecture (Extended Abstract)
  • Meghyn Bienvenu, Camille Bourgaux and Atefe Khodadaditaghanaki Inconsistency Handling in DatalogMTL (Extended Abstract)
  • Franz Baader, Stefan Borgwardt, Filippo De Bortoli and Patrick Koopmann Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Abstract)
  • Francesco Kriegel Reasoning in OWL EL with Hierarchical Concrete Domains (Extended Abstract)
  • Federica Di Stefano, Sanja Lukumbuzya, Magdalena Ortiz and Mantas Šimkus Very Expressive Description Logics  with Rich  yet Affordable Numeric Constraints (Extended Abstract)
  • Anouk Michelle Oudshoorn SHACL Satisfiability: What can we learn from DLs?
  • Gianluca Cima, Marco Console, Roberto Maria Delfino, Maurizio Lenzerini and Antonella Poggi Answering Expressive Conjunctive Queries over RDFS Knowledge Bases (Extended Abstract)
  • Roberto Maria Delfino, Maurizio Lenzerini and Antonella Poggi Logic-based Semantics and Query Entailment for RDFS Knowledge Graphs (Extended Abstract)
  • Bianca Löhnert, Nikolaus Augsten, Cem Okulmus and Magdalena Ortiz Query Rewriting for Nested Navigational Queries over Property Graphs
  • Meghyn Bienvenu, Diego Figueira and Pierre Lafourcade Tractable Responsibility Measures for Ontology-Mediated Query Answering (Extended Abstract)
  • Camille Bourgaux, Anton Gnatenko and Michaël Thomazo Analysing Temporal Reasoning in Description Logics Using Formal Grammars (Extended Abstract)
  • Jean Christoph Jung, Vladislav Ryzhikov, Frank Wolter and Michael Zakharyaschev Complexity of containment for conjunctive LTL queries
  • Franz Baader and Anton Claußnitzer Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count (Extended Abstract)
  • Federica Di Stefano, Quentin Manière, Magdalena Ortiz and Mantas Šimkus Minimal Model Reasoning in Description Logics: Don’t Try This at Home! (Extended Abstract)
  • Anselm Haak, Patrick Koopmann, Yasir Mahmood and Anni-Yasmin Turhan Why not? Developing ABox Abduction beyond Repairs
  • Meghyn Bienvenu and Quentin Manière Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics (Extended Abstract)
  • Meghyn Bienvenu, Camille Bourgaux, Katsumi Inoue and Robin Jean A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases (Extended Abstract)
  • Daumantas Kojelis On Homogeneous Models of Fluted Languages (Extended Abstract)
  • Bartosz Bednarczyk and Emanuel Kieroński Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Abstract)
  • Joshua Hirschbrunn and Yevgeny Kazakov Extending Description Logics with Generic Concepts – the Case of Terminologies
  • David Toman and Grant Weddell Structural Equality Generating Dependencies and Definite Descriptions
  • Tobias John, Einar Broch Johnsen, Eduard Kamburjan and Dominic Steinhöfel Testing Description Logic Reasoners (Extended Abstract)
  • Divya Baura and Diego Calvanese Real-world Assessment of Policy-Protected OBDA
  • Ruud van Bakel, Michael Cochez and Patrick Koopmann Towards Conceptual Clustering in EL with Simulation Graphs
  • Thanasis Apostolopoulos, Spyridon Kantarelis and Giorgos Stamou The ontocomc ontology: A Semantic Framework for Hindemith’s Harmonic System
  • Christian Alrabbaa, Franz Baader, Raimund Dachselt, Alisa Kovtunova and Julián Méndez The Concrete Evonne: Visualization Meets Concrete Domain Reasoning (Extended Abstract)
  • Stefan Borgwardt, Duy Nhu and Gabriele Röger Automated Planning with Ontologies under Coherence Update Semantics (Extended Abstract)
  • Moritz Illich and Birte Glimm Backward/Forward with Marking for Update Streams
  • Enamul Haque, David Toman and Grant Weddell Reliable Reference for a DL Knowledge Base under Data Update
  • Sergei Obiedkov and Barış Sertkaya PAC Learning of Concept Inclusions for Ontology- Mediated Query Answering (Extended Abstract)
  • Janka Boborová, Jakub Kloc, Martin Homola and Júlia Pukancová On the Way to Diverse Datasets for Evaluating ABox Abduction Algorithms
  • Sławomir Kost and Barbara Morawska Around unification in FL\_bottom — three related problems
  • Barbara Morawska, Dariusz Marzec, Sławomir Kost and Michał Henne FILO: unification solver for FL_0
  • Jakub Kloc, Janka Boborová, Martin Homola and Júlia Pukancová CATS Solver: The Rise of Hybrid Abduction Algorithms
  • Zekeri Adams, Martin Homola and Ján Kl’Uka Can Full Set-Theoretical Subsumption Semantics in Metamodelled Description Logics Be Captured Within Decidable FOL Fragments?
  • Michal Sochański, Przemysław Andrzej Wałęga and Michal Zawidzki Two Types of Definite Descriptions: Theory and Implementation
  • Lorenzo Marconi, Flavia Ricci and Riccardo Rosati Controlled Query Evaluation with Epistemic Dependencies: Algorithms and Experiments (Extended Abstract)
  • Jonas Philipp Haldimann, Magdalena Ortiz and Mantas Šimkus Towards Practicable Defeasible Reasoning for ABoxes (Extended Abstract)
  • Anders Søberg, Martin Giese and Egor V. Kostylev Description Logics with Epsilon Individuals
  • Francesco Kriegel Using Trémaux Trees to Compute Small Conjunctive Queries that Separate Positive and Negative Examples
  • Shikhat Karkee, Elena Botoeva, Sam Coombes, Anna Jordanous, Özgür Kafali and Davide Lanti Accessing Semistructured Data with KGs and LLMs