Preliminary Schedule
Schedule for 2026-07-20
Room 1
Room 2
Room 3
Keynote
09:00 - 10:00
Coffee Break
10:00 - 10:30
KR Opening
10:30 - 11:00
Argumentation 1
11:00 - 12:40
- 11:00-11:25 Computing Extensions of Abstact Argumentation Frameworks by Enumerating Closed Sets
- 11:25-11:50 Tenability and Weak Semantics: Modeling Non-uniform Defense
- 11:50-12:15 Belief Function Propagation in Quantitative Bipolar Argumentation Frameworks
- 12:15-12:40 Contestability in Edge-Weighted Quantitative Bipolar Argumentation Frameworks
Lunch
12:40 - 14:00
Belief change and epistemic logic
14:00 - 15:35
- 14:00-14:25 Revealed Epistemic Trust
- 14:25-14:50 Suspending Judgement: belief contraction in dynamic epistemic logic
- 14:50-15:15 A Study of Belief Revision Postulates in Multi-Agent Systems
- 15:15-15:35 Model Change for Description Logic Concepts
Coffee Break
15:35 - 16:00
KR Invited: Magdalena Ortiz
16:00 - 17:00
- 16:00-17:00 It's all Connected: Knowledge Representation for Graph Data
Reception
18:00 - 20:00
Keynote
09:00 - 10:00
Coffee Break
10:00 - 10:30
Knowledge compilation
11:00 - 12:40
- 11:00-11:25 A Distributed Framework for Compiling and Reasoning with d-DNNF
- 11:25-11:50 From Tensor Networks to Tractable Circuits, and back
- 11:50-12:15 Compiling Defeasible Inference: A Dynamic Approach To System Z
- 12:15-12:40 Knowledge Compilation for Quantification in Alternating Automata
Lunch
12:40 - 14:00
Abduction and diagnosis
14:00 - 15:35
- 14:00-14:25 ABD: Default–Exception Abduction in Finite First-Order Worlds
- 14:25-14:50 But Not Because You Said So! Implicitly Accepting Information with Abductive Belief-Base Change
- 14:50-15:15 ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
- 15:15-15:35 Summary of: On Validating Propositional Logic System Descriptions for Fault Diagnosis
Coffee Break
15:35 - 16:00
Reception
18:00 - 20:00
Keynote
09:00 - 10:00
Coffee Break
10:00 - 10:30
Probability
11:00 - 12:40
- 11:00-11:25 Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic
- 11:25-11:50 Probabilistic Abduction in a Fuzzy Logic Framework
- 11:50-12:15 A Probabilistic Framework for Hierarchical Goal Recognition
- 12:15-12:40 Large Language Models as Nondeterministic Causal Models
Lunch
12:40 - 14:00
Reasoning on actions
14:00 - 15:35
- 14:00-14:25 I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems
- 14:25-14:50 Specifying Agent Strategy Spaces via LTL Synthesis
- 14:50-15:15 Revisiting Ability-Based Bisimulation
- 15:15-15:35 Reasoning over Streams of Events with Delayed Effects
Coffee Break
15:35 - 16:00
Reception
18:00 - 20:00
Schedule for 2026-07-21
Room 1
Room 2
Room 3
KR invited: Carsten Lutz
09:00 - 10:00
- 09:00-10:00 The Logical Expressive Power of Graph Neural Networks
KR awards
10:00 - 10:30
Chair: Tommie Meyer
Coffee Break
10:30 - 11:00
Nonmonotonic logic
11:00 - 12:35
- 11:00-11:25 Beyond Consistency: A Closer Look at Free Formulas
- 11:25-11:50 Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics
- 11:50-12:15 Safely Decomposing Conditional Belief Bases Into c-LEG Networks
- 12:15-12:35 Representation Theorems for Cumulative Propositional Dependence Logics
Lunch
12:35 - 14:00
Answer Set Programming 1
14:00 - 16:00
- 14:00-14:25 Beyond Uniform: To Boldly Abstract What Has Not Been Abstracted Before
- 14:25-14:45 Simple Guess-and-Check Programs: Strong and Uniform Equivalence Meet Again
- 14:45-15:10 A Normal Form for Rules Containing Arithmetic Operations
- 15:10-15:35 Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis
- 15:35-16:00 Counting Complexity of ASP
Coffee Break
16:00 - 16:30
Neural-symbolic learning
16:30 - 18:35
- 16:30-16:55 Semantic Foundations of Neuro-Symbolic Multi-Agent Systems
- 16:55-17:20 Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic
- 17:20-17:45 Symbolic Knowledge Transfer for Sample-Efficient Deep Reinforcement Learning
- 17:45-18:10 SafeTap: Neurosymbolic Language to Quadrupedal Locomotion via Reactive Synthesis Modulo Bitvectors
- 18:10-18:35 Neuro-Symbolic Causal Boosting: A Framework for Interpretable Attribution of Business Fluctuations
Coffee Break
10:30 - 11:00
Graph Data
11:00 - 12:35
- 11:00-11:25 Common Foundations for Recursive Shape Languages
- 11:25-11:50 Static Analysis of Recursive SHACL
- 11:50-12:15 Almost Certain Query Answering over Incomplete Relational and Graph Data
- 12:15-12:35 A Simple Baseline for Inductive Knowledge Base Completion
Lunch
12:35 - 14:00
Description logics and databases
14:00 - 15:55
- 14:00-14:25 Partially Finite Model Reasoning in Description Logics
- 14:25-14:50 How Hard is it to Decide if a Fact is Relevant to a Query?
- 14:50-15:15 Complexity of Logics with Semiring Semantics
- 15:15-15:35 Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics
- 15:35-15:55 Inclusion with Repetitions and Boolean Constants — Implication Problems Revisited
Coffee Break
16:00 - 16:30
Planning
16:30 - 18:35
- 16:30-16:55 Over All, PDDL Semantics is Simultaneously Simple and Hard to Get Right
- 16:55-17:20 Synthesis Foundations for Online LTLf Goal Management
- 17:20-17:45 On-the-fly LTLf Synthesis under Partial Observability
- 17:45-18:10 Reactive Synthesis for Golog Specifications in the Propositional Situation Calculus
- 18:10-18:35 Optimal In-Station Train Dispatching via Symbolic Pattern Planning
Coffee Break
10:30 - 11:00
Doctoral Consortium (talks)
11:00 - 11:45
- 11:00-11:09 Introduction
- 11:09-11:12 ASP Encodings for Multi-Commodity Batch Scheduling in Logistics Networks
- 11:12-11:15 Knowledge-Based Stable Roommates Problems
- 11:15-11:18 How Can Inconsistent Agents Become Consistent?
- 11:18-11:21 Graphical representations of KLM-style defeasible justifications for propositional logic
- 11:21-11:24 KLM-Style Defeasibility in Modal and Description Logics
- 11:24-11:27 Towards Defeasible Semantics for Symbolic Classifiers
- 11:27-11:30 Integrating and Reasoning with Data-Induced Information: Knowledge Bases of Axioms and Learned Models
- 11:30-11:33 Defining Goals using Knowledge Representation for Aligned Reinforcement Learning
- 11:33-11:36 Predictive Control of BDD Growth: Reinforcement Learning for Dynamic Variable Reordering
- 11:36-11:39 Generalization in Reinforcement Learning from Logical Specifications
- 11:39-11:42 A framework for Counterfactual Explainability in Graph Neural Networks
- 11:42-11:45 Practical Methods for Concept Interpolation in Realistic Ontologies
Doctoral Consortium (posters)
11:45 - 12:45
Lunch
12:35 - 14:00
Explanation
14:00 - 16:00
- 14:00-14:25 Precise and Efficient Model-Agnostic Explanations
- 14:25-14:50 Model-Agnostic Explanations by Consensus
- 14:50-15:15 Explaining Classification Through Global Sufficient Reasons and its Complexity
- 15:15-15:35 A Map–Summarize Framework for Answer Set Verbalization
- 15:35-16:00 Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
Coffee Break
16:00 - 16:30
Datalog and existential rules
16:30 - 18:35
- 16:30-16:55 Why(-Not)-Provenance for Datalog with Negation
- 16:55-17:20 Efficient Temporal Datalog Materialisation for Composite Event Recognition
- 17:20-17:45 Efficient Temporal Reasoning with Non-Temporal Engines: Embedding DatalogMTL into Datalog
- 17:45-18:10 The Chase in Lean - Crafting a Formal Library for Existential Rule Research
- 18:10-18:35 VADAOrchestra: Neurosymbolic Orchestration of Adaptive Reasoning Workflows
Schedule for 2026-07-22
Room 1
Room 2
Room 3
Keynote
09:00 - 10:00
Coffee Break
10:00 - 10:30
Diversity and inclusion
10:30 - 11:30
Reinforcement learning and norms
11:40 - 12:25
- 11:40-12:05 Scalable Learning of Challenging Normative Behaviours with Deep RL
- 12:05-12:25 Normative Narrator: Guiding and Explaining Reinforcement Learning Agents
Lunch
12:30 - 14:00
Belief change
14:00 - 15:35
- 14:00-14:20 AGM Belief Revision, Semantically (Extended Abstract)
- 14:20-14:45 Expressiveness of Epistemic Spaces for Iterated Belief Change Operators
- 14:45-15:10 Truth-Tracking by Iterated Belief Change
- 15:10-15:35 Interval Orders, Biorders and Credibility-limited Belief Revision
Coffee Break
15:35 - 16:00
Expressivity of neural networks
16:00 - 18:00
- 16:00-16:25 Unifying approach to uniform expressivity of graph neural networks
- 16:25-16:50 Recurrent Graph Neural Networks and Arithmetic Circuits
- 16:50-17:15 The Polynomial Counting Capabilities of Message Passing Neural Networks
- 17:15-17:35 Extended Abstract: Aggregate-Combine-Readout GNNs Can Express Logical Classifiers Beyond the Logic C2
- 17:35-18:00 How Aggregation Functions Affect the Uniform Expressiveness of Graph Neural Networks
Banquet
19:00 - 23:00
Keynote
09:00 - 10:00
Coffee Break
10:00 - 10:30
SAT encoding
11:40 - 12:30
- 11:40-12:05 SRIP: A SAT-based System for Independent Set Reconfiguration
- 12:05-12:30 SAT-based ASP Solving and Optimization via a General Transitive Closure Framework
Lunch
12:30 - 14:00
Learning for planning
14:00 - 15:35
- 14:00-14:25 Learning Numeric Planning Domain Models From Positive Observations
- 14:25-14:50 From Next Token Prediction to (STRIPS) World Models
- 14:50-15:15 Learning Lifted Action Models from Traces with Minimal Information About Actions and States
- 15:15-15:35 Learning Broadcast Protocols
Coffee Break
15:35 - 16:00
Temporal reasoning
16:00 - 18:00
- 16:00-16:25 Generating Explainable Counterfactual Policies through Temporal Logic Queries
- 16:25-16:50 Time Robustness for Point-Based Semantics of Metric Interval Temporal Logic
- 16:50-17:10 Hierarchical Models of Multi-Agent Systems: Strategic Ability and Model Checking
- 17:10-17:35 Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification
- 17:35-18:00 AIGLE: A Tool for Compact, Legible AIGER Circuits from Safety Specifications
Banquet
19:00 - 23:00
Keynote
09:00 - 10:00
Coffee Break
10:00 - 10:30
Epistemic logic
11:40 - 12:30
- 11:40-12:05 A Logic of Limited Belief with Introspection Based on Possible Worlds
- 12:05-12:30 Cops only need factual knowledge to catch robbers
Lunch
12:30 - 14:00
Preferences
14:00 - 15:15
- 14:00-14:25 On Sufficient Conditions for Consistency Checking in CP-theory Preferences
- 14:25-14:50 Voting Compilation Revisited
- 14:50-15:15 Reasoning about Welfare-Affecting Capabilities in Concurrent Games
Coffee Break
15:35 - 16:00
Argumentation and applications
16:00 - 18:00
- 16:00-16:25 Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework
- 16:25-16:50 Learnable Multi-Attribute Gradual Semantics for Predicting Persuasion in Argumentative Debates
- 16:50-17:10 Evaluating LLM-Driven Summarisation of Parliamentary Debates with Computational Argumentation
- 17:10-17:35 Argumentation for Explainable and Globally Contestable Decision Support with LLMs
- 17:35-18:00 X-ABALearn: Argumentative Learning with Semantics `a la Carte
Banquet
19:00 - 23:00
Schedule for 2026-07-23
Room 1
Room 2
Room 3
KR Invited: Joao Marques-Silva
09:00 - 10:00
- 09:00-10:00 Rigorous Explainability by Feature Attribution: From SHAP to nuSHAP
Coffee Break
10:00 - 10:30
Neural-symbolic learning and logic
10:30 - 12:30
- 10:30-10:55 Gradient-Based Optimization on Gödel Logic as Discrete Local Search
- 10:55-11:20 Logic of Hypotheses: from Zero to Full Knowledge in Neurosymbolic Integration
- 11:20-11:45 Constraint-Based Analysis of Reasoning Shortcuts in Neurosymbolic Learning
- 11:45-12:05 Graph-Based Attention for Differentiable MaxSAT Solving
- 12:05-12:30 SC$^2$: Safe Control via Shielding for CPCTL specifications
Lunch
12:30 - 14:00
Machine learning and explanation
14:00 - 16:00
- 14:00-14:25 RegD: Hierarchical Embeddings via Dissimilarity between Arbitrary Euclidean Regions
- 14:25-14:50 A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees
- 14:50-15:15 Do Transformers Learn What Theory Predicts? Knowledge Representation-Guided Mechanistic Verification via Causal Abstraction
- 15:15-15:40 Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
- 15:40-16:00 Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement
Coffee Break
16:00 - 16:30
KR closing session
16:30 - 17:00
Coffee Break
10:00 - 10:30
Argumentation 2
10:30 - 12:30
- 10:30-10:55 Splitting Argumentation Frameworks with Collective Attacks and Supports
- 10:55-11:15 Computational Complexity in Timed Argumentation Frameworks
- 11:15-11:40 Splitting Assumption-Based Argumentation Frameworks
- 11:40-12:05 Elucidating Arguments Maps in Propositional Logic: Addressing Enthymemes and their Relationships
- 12:05-12:30 Proof-search for normative and doxastic reasoning and its use in logical argumentation
Lunch
12:30 - 14:00
Answer Set Programming 2
14:00 - 16:00
- 14:00-14:25 Using ASP(Q) to Handle Inconsistent Prioritized Data
- 14:25-14:50 Probabilistic Reasoning within Answer Set Programming with Quantifiers
- 14:50-15:10 2-ASP(Q) Solving Based on CEGAR
- 15:10-15:35 Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications
- 15:35-16:00 ALM–ASP: A Functional Agentic Architecture for Answer Set Programming
Coffee Break
16:00 - 16:30
Coffee Break
10:00 - 10:30
Description logic and learning
10:30 - 12:25
- 10:30-10:55 Fitting Horn DL Ontologies to ABox and Query Examples: A Tale of Simulation Quantifiers and Finite Models
- 10:55-11:15 PAC Learning of Concept Inclusions for Ontology-Mediated Query Answering
- 11:15-11:35 The Correspondence Between Bounded Graph Neural Networks and Fragments of First-Order Logic (Extended Abstract)
- 11:35-12:00 DeepEL: Deep Learning and Formal Description Logic Reasoning
- 12:00-12:25 BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization
Lunch
12:30 - 14:00
Beyond SAT
14:00 - 15:40
- 14:00-14:25 Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
- 14:25-14:50 Finding Nash Stable Coalitions under Membership Rights in Boolean Hedonic Games
- 14:50-15:15 BAss: Symbolic Reasoning in Abstract Dialectical Frameworks
- 15:15-15:40 Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
Coffee Break
16:00 - 16:30