Programme

Keynote speaker

    Meghyn Bienvenu
CNRS, LaBRI research lab, University of Bordeaux, France.
Keynote title: Repair-Based Semantics for Querying Inconsistent Data: From Databases to Knowledge Bases and Back
Keynote abstract: Consistent query answering was introduced twenty-five years ago as a principled means of querying inconsistent databases. It is based upon a simple idea: when it is impossible or infeasible to identify the true consistent database, then define instead a space of possible repairs (consistent databases that ‘minimally’ differ from the input database) and output those query answers that hold w.r.t. every repair. This approach has subsequently inspired an active line of research within the KR community, which has extended and adapted the framework to the case of inconsistent knowledge bases (consisting of a dataset and an ontology). In this talk, I will survey recent advances on repair-based semantics and highlight the insights that have been gained, considering both the database and ontology settings.

Accepted papers

  • Ali Khazraee, Abdolreza Mirzaei, Majid Farhadi, Parmis Naddaf, Kiarash Zahirnia, Mohammad Salameh, Kevin Cannons, Richard Mar, Erfaneh Mahmoudzadeh, Oliver Schulte:
    Enhancing Graph Learning With First-Order Logic Rules pdf
  • Bita Banihashemi, Megh Patel, Yves Lesperance:
    Using Large Language Models for Abstraction of Planning Domains pdf
  • Lars Bengel, Matthias Thimm:
    Initial Models and Serialisability in Abstract Dialectical Frameworks (Extended Abstract) pdf
  • Mikhail Soutchanski, Yongmei Liu:
    Planning with Dynamically Changing Domains pdf
  • Lydia Blümel, Anna Rapberger, Matthias Thimm, Francesca Toni:
    On Independence and SCC-Recursiveness in Assumption-Based Argumentation (Extended Abstract) pdf
  • Dillon Z. Chen, Till Hofmann, Toryn Q. Klassen, Sheila A. McIlraith:
    MOOSE: Satisficing and Optimal Generalised Planning via Goal Regression pdf
  • Victor Lagerkvist, Mohamed Maizia, Johannes Schmidt:
    A Fine-Grained Complexity View on Propositional Abduction — Algorithms and Lower Bounds (Extended Abstract) pdf
  • Jeroen Spaans, Jesse Heyninck:
    A Unifying Framework for Semiring-Based Constraint Logic Programming With Negation (Extended Abstract) pdf
  • Yasir Mahmood, Jonathan Persson, Victor Lagerkvist, Nicolas Fröhlich, Arne Meier, Markus Hecher, Johannes K. Fichte:
    Facets in Argumentation: A Formal Approach to Argument Significance (Extended Abstract) pdf
  • Meghyn Bienvenu, Camille Bourgaux, Atefe Khodadaitaghanaki:
    Inconsistency Handling in DatalogMTL (Extended Abstract) pdf
  • Gaia Belardinelli, Thomas Bolander, Sebastian Watzl:
    A Logic for General Attention Using Edge-Conditioned Event Models (Extended Abstract) pdf
  • Lars-Phillip Spiegel, Jonas Haldimann, Jesse Heyninck, Gabriele Kern-Isberner, Christoph Beierle:
    Generalized Safe Conditional Syntax Splitting of Belief Bases (Extended Abstract) pdf
  • Thomas Eiter, Davide Soldà:
    On Temporal ASP with Eager Unfoldable Operators (Extended Abstract) pdf

The proceedings of TKR'25 are also available as a technical report at https://zenodo.org/records/15799038.

Detailed programme

08:45-09:00 Welcome
09:00-10:00 Keynote: Meghyn Bienvenu
Repair-Based Semantics for Querying Inconsistent Data: From Databases to Knowledge Bases and Back
10:00-10:25 Eiter, Soldà: On Temporal ASP with Eager Unfoldable Operators (Extended Abstract)
10:25-10:55 Coffee break
10:55-11:20 Spaans, Heyninck: A Unifying Framework for Semiring-Based Constraint Logic Programming With Negation (Extended Abstract)
11:20-11:45 Bienvenu et al.: Inconsistency Handling in DatalogMTL (Extended Abstract)
11:45-12:10 Khazraee et al.: Enhancing Graph Learning With First-Order Logic Rules
12:10-12:35 Lagerkvist et al.: A Fine-Grained Complexity View on Propositional Abduction — Algorithms and Lower Bounds (Extended Abstract)
12:35-13:50 Lunch break
13:50-14:15 Bengel, Thimm: Initial Models and Serialisability in Abstract Dialectical Frameworks (Extended Abstract)
14:15-14:40 Blümel et al.: On Independence and SCC-Recursiveness in Assumption-Based Argumentation (Extended Abstract)
14:40-15:25 Mahmood et al.: Facets in Argumentation: A Formal Approach to Argument Significance (Extended Abstract)
15:25-15:50 Spiegel et al.: Generalized Safe Conditional Syntax Splitting of Belief Bases (Extended Abstract)
15:50-16:20 Coffee break
16:20-16:45 Banihashemi et al.: Using Large Language Models for Abstraction of Planning Domains
16:45-17:10 Soutchanski, Liu: Planning with Dynamically Changing Domains
17:10-17:35 Chen et al.: MOOSE: Satisficing and Optimal Generalised Planning via Goal Regression
17:35-18:00 Belardinelli et al.: A Logic for General Attention Using Edge-Conditioned Event Models (Extended Abstract)
18:00-18:15 Closing