Accepted Submissions

Main Track

Regular Papers

• Probabilistic Abduction in a Fuzzy Logic Framework
  T. Flaminio, K. Inoue, D. Kozhemiachenko
• Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic
  D. Kozhemiachenko, I. Sedlár
• A Normal Form for Rules Containing Arithmetic Operations
  J. Fandinno, Y. Lierler, V. Lifschitz
• Beyond Consistency: A Closer Look at Free Formulas
  O. Arieli, B. Raddaoui, C. Strasser
• Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics
  X. Parent
• Over All, PDDL Semantics is Simultaneously Simple and Hard to Get Right
  N. Gigante, A. Micheli, E. Scala, A. Valentini
• Counting Complexity of ASP
  M. Bannach, J. Fichte, J. Groven, M. Hecher
• Safely Decomposing Conditional Belief Bases Into c-LEG Networks
  G. Kern-Isberner, A. Hahn, L. Spiegel, M. Wilhelm, C. Beierle
• Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification
  K. Dabrowski, P. Jonsson, S. Ordyniak, G. Osipov, J. de Vlas
• Compiling Defeasible Inference: A Dynamic Approach To System Z
  L. Slater, T. Meyer, J. Heyninck
• A Study of Belief Revision Postulates in Multi-Agent Systems
  M. Thielscher, T. Son
• Expressiveness of Epistemic Spaces for Iterated Belief Change Operators
  N. Schwind, S. Konieczny, R. Perez
• Truth-Tracking by Iterated Belief Change
  N. Schwind, P. Everaere, S. Konieczny
• Probabilistic Reasoning within Answer Set Programming with Quantifiers
  D. Azzolini, G. Mazzotta, F. Ricca
• Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
  L. Eriksson, V. Lagerkvist, S. Ordyniak, G. Osipov, F. Panolan, M. Rychlicki
• The Chase in Lean - Crafting a Formal Library for Existential Rule Research
  L. Gerlach
• Partially Finite Model Reasoning in Description Logics
  T. Gogacz, F. Murlak, M. Przybyłko, A. Rogova, M. Skrzypczak
• Contestability in Edge-Weighted Quantitative Bipolar Argumentation Frameworks
  X. Yin, N. Potyka, A. Rago, T. Kampik, F. Toni
• Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
  F. Vehlken, T. Zeume, E. Bustamante, M. Cornély, L. Pradel
• Beyond Uniform: To Boldly Abstract What Has Not Been Abstracted Before
  M. Knorr, Z. Saribatur, R. Gonçalves
• Using ASP(Q) to Handle Inconsistent Prioritized Data
  M. Bienvenu, C. Bourgaux, R. Jean, G. Mazzotta
• Reasoning about Welfare-Affecting Capabilities in Concurrent Games
  Y. Li, E. Lorini
• Elucidating Arguments Maps in Propositional Logic: Addressing Enthymemes and their Relationships
  J. Ben-Naim, V. David, A. Hunter
• Reactive Synthesis for Golog Specifications in the Propositional Situation Calculus
  G. De Giacomo, Y. Lespérance, M. Mancanelli, G. Parretti
• Revisiting Ability-Based Bisimulation
  C. Areces, R. Fervari, A. Mondejar
• Fitting Horn DL Ontologies to ABox and Query Examples: A Tale of Simulation Quantifiers and Finite Models
  M. Grosser, C. Lutz
• ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
  A. Haak, P. Koopmann, Y. Mahmood, A. Turhan
• Computing Extensions of Abstact Argumentation Frameworks by Enumerating Closed Sets
  S. Obiedkov, B. Sertkaya
• How Hard is it to Decide if a Fact is Relevant to a Query?
  M. Bienvenu, D. Figueira, P. Lafourcade
• Voting Compilation Revisited
  Y. Chevaleyre, J. Lang, N. Maudet
• Belief Function Propagation in Quantitative Bipolar Argumentation Frameworks
  J. Thieyre, A. Beynier, S. Destercke, N. Maudet, S. Vesic
• Static Analysis of Recursive SHACL
  A. Oudshoorn, M. Ortiz, M. Simkus
• Querying Linear Existential Rules Enriched with Transitive Relations
  M. Lanzinger, A. Pieris, M. Šimkus
• Synthesis Foundations for Online LTLf Goal Management
  G. De Giacomo, Y. Lespérance, G. Parretti, F. Patrizi
• Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications
  Y. AWUKLU, M. Bienvenu, K. Inoue, F. Mougin, V. Jouhet
• Proof-search for normative and doxastic reasoning and its use in logical argumentation
  K. van Berkel, A. Sabatini
• On-the-fly LTLf Synthesis under Partial Observability
  N. Alon, S. Chakraborty, A. Duret-Lutz, D. Fried, L. Tabajara, M. Vardi, S. Zhu
• Interval Orders, Biorders and Credibility-limited Belief Revision
  R. Booth, I. Varzinczak
• Suspending Judgement: belief contraction in dynamic epistemic logic
  A. Baltag, V. Fiutek, S. Smets
• Learning Numeric Planning Domain Models From Positive Observations
  O. Watted, A. Mordoch, R. Stern
• I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems
  R. Galimullin, H. Grosinger, M. Mittelmann
• On Sufficient Conditions for Consistency Checking in CP-theory Preferences
  E. Rauer, S. Basu
• Revealed Epistemic Trust
  X. Li, L. van der Torre, L. Yu
• Efficient Temporal Datalog Materialisation for Composite Event Recognition
  P. Mantenoglou
• Specifying Agent Strategy Spaces via LTL Synthesis
  B. Aminof, G. De Giacomo, A. Murano, S. Rubin
• Splitting Assumption-Based Argumentation Frameworks
  G. Buraglio, W. Dvořák, S. Woltran
• Almost Certain Query Answering over Incomplete Relational and Graph Data
  H. Liu, L. Libkin, E. Ternovska
• But Not Because You Said So! Implicitly Accepting Information with Abductive Belief-Base Change
  M. Bayerkuhnlein, Ö. Özcep, D. Wolter
• Cops only need factual knowledge to catch robbers
  D. Li, S. Ghosh
• Time Robustness for Point-Based Semantics of Metric Interval Temporal Logic
  S. Silvetti, I. Compagnucci, F. Cairoli, C. Trubiani, L. Nenzi
• A Logic of Limited Belief with Introspection Based on Possible Worlds
  G. Lakemeyer, H. Levesque
• Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
  U. Bartal, D. Fried, J. Lagniez
• Splitting Argumentation Frameworks with Collective Attacks and Supports
  M. Berthold, L. Blümel, G. Buraglio, A. Rapberger
• Common Foundations for Recursive Shape Languages
  S. Ahmetaj, I. Boneva, J. Hidders, M. Jakubowski, J. Labra-Gayo, W. Martens, F. Mogavero, F. Murlak, C. Okulmus, O. Savkovic, M. Šimkus, D. Tomaszuk
• Tenability and Weak Semantics: Modeling Non-uniform Defense
  U. Andrews, L. Mauro, J. Spoerl
• A Probabilistic Framework for Hierarchical Goal Recognition
  C. Zhang, K. Ip, H. Rezatofighi, B. Say, M. Vered
• Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework
  S. Wei, Y. Chen, B. Liao
• Knowledge Compilation for Quantification in Alternating Automata
  N. Metzger, A. Cantarella, B. Finkbeiner, S. Chakraborty, S. Akshay
• Complexity of Logics with Semiring Semantics
  T. Barlag, N. Fröhlich, T. Hankala, M. Hannula, M. Hirvonen, V. Holzapfel, J. Kontinen, A. Meier, L. Strieker
• From Tensor Networks to Tractable Circuits, and back
  A. Quist, M. Farreras, A. de Colnet, J. van de Wetering, A. Laarman
• Finding Nash Stable Coalitions under Membership Rights in Boolean Hedonic Games
  A. Conati, A. Niskanen, R. de Haan, M. Järvisalo
• Why(-Not)-Provenance for Datalog with Negation
  B. Bogaerts, M. Calautti, A. Pieris, S. Pollaci, R. Van den Eede

Short Papers

• Computational Complexity in Timed Argumentation Frameworks
  J. Mailly, F. Maris, J. Wallner
• Representation Theorems for Cumulative Propositional Dependence Logics
  J. Kontinen, A. Meier, K. Sauerwald
• Simple Guess-and-Check Programs: Strong and Uniform Equivalence Meet Again
  W. Dvorak, Z. Saribatur, S. Woltran
• Hierarchical Models of Multi-Agent Systems: Strategic Ability and Model Checking
  R. Galimullin, W. Jamroga, D. Kurpiewski, V. Malvone, A. Murano

KR meets Machine Learning and Explanation

Regular Papers

• SafeTap: Neurosymbolic Language to Quadrupedal Locomotion via Reactive Synthesis Modulo Bitvectors
  A. Rodriguez, C. Sanchez
• ABD: Default–Exception Abduction in Finite First-Order Worlds
  S. Batzoglou
• RegD: Hierarchical Embeddings via Dissimilarity between Arbitrary Euclidean Regions
  H. Yang, J. Chen
• Learnable Multi-Attribute Gradual Semantics for Predicting Persuasion in Argumentative Debates
  E. Cabrio, V. David, A. Hunter, P. Monnin, N. Pireaud
• A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees
  G. Audemard, S. Coste-Marquis, P. Marquis, M. SABIRI, N. Szczepanski
• DeepEL: Deep Learning and Formal Description Logic Reasoning
  A. Longato, Ignacio, R. Peñaloza
• BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization
  B. Lourenço, H. Morgan, A. Ozaki, A. Pavlović, E. Sallinger
• ALM–ASP: A Functional Agentic Architecture for Answer Set Programming
  L. Reiners, A. Tarzariol, M. Alviano, M. Santana, K. Schekotihin
• Do Transformers Learn What Theory Predicts? Knowledge Representation-Guided Mechanistic Verification via Causal Abstraction
  C. Lu, R. Schmidt, Y. Zhao
• Unifying approach to uniform expressivity of graph neural networks
  H. Luo, J. Virtema
• Recurrent Graph Neural Networks and Arithmetic Circuits
  T. Barlag, V. Holzapfel, L. Strieker, J. Virtema, H. Vollmer
• Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic
  M. Vargas Guzmán, J. Szymanik, M. Malicki
• Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
  A. Chernobrovkin, M. Sälzer, F. Schwarzentruber, N. Troquard
• Generating Explainable Counterfactual Policies through Temporal Logic Queries
  A. Lequen, C. Legrand-Lixon, L. Saulières
• The Polynomial Counting Capabilities of Message Passing Neural Networks
  M. Sälzer, P. Bergsträßer, A. Lin
• How Aggregation Functions Affect the Uniform Expressiveness of Graph Neural Networks
  S. Hauke, P. Wałęga
• Explaining Classification Through Global Sufficient Reasons and its Complexity
  M. Calautti, E. Malizia, C. Molinaro
• Logic of Hypotheses: from Zero to Full Knowledge in Neurosymbolic Integration
  D. Bizzaro, A. Daniele
• Precise and Efficient Model-Agnostic Explanations
  J. Lefebre-Lobaina, M. Martinez, J. Marques-Silva
• VADAOrchestra: Neurosymbolic Orchestration of Adaptive Reasoning Workflows
  T. Baldazzi, L. Bellomarini, A. Coletta, M. Iezzi, C. Maple, A. Pesare, E. Sallinger
• Argumentation for Explainable and Globally Contestable Decision Support with LLMs
  A. Dejl, M. Williams, F. Toni
• Constraint-Based Analysis of Reasoning Shortcuts in Neurosymbolic Learning
  A. Takemura, K. Inoue, M. Nishino
• From Next Token Prediction to (STRIPS) World Models
  C. Núñez-Molina, V. Gómez, H. Geffner
• Symbolic Knowledge Transfer for Sample-Efficient Deep Reinforcement Learning
  C. Veronese, A. Farinelli, D. Meli
• Semantic Foundations of Neuro-Symbolic Multi-Agent Systems
  J. Gutierrez
• Learning Lifted Action Models from Traces with Minimal Information About Actions and States
  J. Gösgens, N. Jansen, H. Geffner
• Scalable Learning of Challenging Normative Behaviours with Deep RL
  E. Neufeld, T. Engesser, M. Tappler
• X-ABALearn: Argumentative Learning with Semantics `a la Carte
  E. De Angelis, M. Proietti, F. Toni
• Large Language Models as Nondeterministic Causal Models
  S. Beckers
• SC$^2$: Safe Control via Shielding for CPCTL specifications
  E. Hamel-De le Court, G. Ohlmann, F. Belardinelli
• Model-Agnostic Explanations by Consensus
  C. Mencía, R. Béjar, R. Mencía, J. Marques-Silva
• Gradient-Based Optimization on Gödel Logic as Discrete Local Search
  A. Daniele, E. van Krieken
• Neuro-Symbolic Causal Boosting: A Framework for Interpretable Attribution of Business Fluctuations
  Y. Zhao, Y. Wang, C. Ma, H. Sun

Short Papers

• A Simple Baseline for Inductive Knowledge Base Completion
  C. Meilicke, R. Gemulla, J. Naegelen, H. Stuckenschmidt
• A Map–Summarize Framework for Answer Set Verbalization
  M. Alviano, M. Capalbo, S. Piccolo
• Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement
  S. Vasileiou, M. Nguyen, T. Son, H. Cao, E. Pontelli
• Normative Narrator: Guiding and Explaining Reinforcement Learning Agents
  E. Neufeld, K. van Berkel

KR in the Wild

Regular Papers

• Efficient Temporal Reasoning with Non-Temporal Engines: Embedding DatalogMTL into Datalog
  M. van Noort, P. Walega
• Optimal In-Station Train Dispatching via Symbolic Pattern Planning
  M. Cardellini, E. Giunchiglia, D. Anguita, C. Lofiego, L. Oneto, P. Ratto
• A Distributed Framework for Compiling and Reasoning with d-DNNF
  Z. Xu, M. Yin, J. Wang, J. Lagniez
• Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis
  M. Banbara, H. Bannai, T. Horiyama, D. Koeppl, T. Mieno, H. Nabeshima
• SRIP: A SAT-based System for Independent Set Reconfiguration
  T. Soh, A. Kuwahara, M. Banbara, N. Tamura, Y. Kobayashi, Y. Nozaki, T. Ito
• SAT-based ASP Solving and Optimization via a General Transitive Closure Framework
  M. Rankooh, M. Järvisalo
• BAss: Symbolic Reasoning in Abstract Dialectical Frameworks
  S. Pastva, V. Trinh
• AIGLE: A Tool for Compact, Legible AIGER Circuits from Safety Specifications
  M. Brizzio, A. Rodriguez, C. Sanchez, R. Degiovanni

Short Papers

• Evaluating LLM-Driven Summarisation of Parliamentary Debates with Computational Argumentation
  E. Cunningham, J. Cross, D. Greene, A. Rago

Recently Published Research Track

• Summary of: On Validating Propositional Logic System Descriptions for Fault Diagnosis
  A. Diedrich, L. Moddemann, O. Niggemann
• Graph-Based Attention for Differentiable MaxSAT Solving
  S. Moriyama, K. Inoue
• Model Change for Description Logic Concepts
  A. Ozaki, J. Ribeiro
• Reasoning over Streams of Events with Delayed Effects
  P. Mantenoglou, M. Pitsikalis, A. Artikis
• AGM Belief Revision, Semantically (Extended Abstract)
  S. Rudolph, K. Sauerwald
• Learning Broadcast Protocols
  D. Fisman, N. Izsak, S. Jacobs
• The Correspondence Between Bounded Graph Neural Networks and Fragments of First-Order Logic (Extended Abstract)
  B. Grau, E. Feng, P. Wałęga
• 2-ASP(Q) Solving Based on CEGAR
  A. Cuteri, G. Mazzotta, F. Ricca
• PAC Learning of Concept Inclusions for Ontology-Mediated Query Answering
  S. Obiedkov, B. Sertkaya
• Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics
  M. Bienvenu, Q. Manière
• Extended Abstract: Aggregate-Combine-Readout GNNs Can Express Logical Classifiers Beyond the Logic C2
  S. Hauke, P. Wałęga
• Inclusion with Repetitions and Boolean Constants — Implication Problems Revisited
  M. Häggblom

Doctoral Consortium

• KLM-Style Defeasibility in Modal and Description Logics
  N. Leisegang
• Practical Methods for Concept Interpolation in Realistic Ontologies
  X. Yang
• A framework for Counterfactual Explainability in Graph Neural Networks
  M. Villia
• Towards Defeasible Semantics for Symbolic Classifiers
  R. Madzime
• Defining Goals using Knowledge Representation for Aligned Reinforcement Learning
  P. Skaisgiris
• Knowledge-Based Stable Roommates Problems
  M. Fidan
• Generalization in Reinforcement Learning from Logical Specifications
  V. Subramanian
• ASP Encodings for Multi-Commodity Batch Scheduling in Logistics Networks
  R. Dennison, J. Heyninck, T. Meyer
• Graphical representations of KLM-style defeasible justifications for propositional logic
  J. Imrie
• Integrating and Reasoning with Data-Induced Information: Knowledge Bases of Axioms and Learned Models
  L. Papi
• How Can Inconsistent Agents Become Consistent?
  L. Gutsche
• Predictive Control of BDD Growth: Reinforcement Learning for Dynamic Variable Reordering
  L. Slater