KR2026Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning

Main Track

• Common Foundations for Recursive Shape Languages.

  1. Shqiponja Ahmetaj
  2. Iovka Boneva
  3. Jan Hidders
  4. Maxime Jakubowski
  5. Jose-Emilio Labra-Gayo
  6. Wim Martens
  7. Fabio Mogavero
  8. Filip Murlak
  9. Cem Okulmus
  10. Ognjen Savkovic
  11. Mantas Šimkus
  12. Dominik Tomaszuk
  DetailsPDF
• Knowledge Compilation for Quantification in Alternating Automata.

  1. S. Akshay
  2. Alfredo Cantarella
  3. Supratik Chakraborty
  4. Bernd Finkbeiner
  5. Niklas Metzger
  DetailsPDF
• On-the-fly LTLf Synthesis under Partial Observability.

  1. Nadav Alon
  2. Supratik Chakraborty
  3. Alexandre Duret-Lutz
  4. Dror Fried
  5. Lucas M. Tabajara
  6. Moshe Y. Vardi
  7. Shufang Zhu
  DetailsPDF
• Specifying Agent Strategy Spaces via LTL Synthesis.

  1. Benjamin Aminof
  2. Giuseppe De Giacomo
  3. Aniello Murano
  4. Sasha Rubin
  DetailsPDF
• Tenability and Weak Semantics: Modeling Non-uniform Defense.

  1. Uri Andrews
  2. Luca San Mauro
  3. John Spoerl
  DetailsPDF
• Revisiting Ability-Based Bisimulation.

  1. Carlos Areces
  2. Raul Fervari
  3. Antonio Mondejar
  DetailsPDF
• Beyond Consistency: A Closer Look at Free Formulas.

  1. Ofer Arieli
  2. Badran Raddaoui
  3. Christian Straßer
  DetailsPDF
• Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications.

  1. Yvon K. Awuklu
  2. Meghyn Bienvenu
  3. Katsumi Inoue
  4. Vianney Jouhet
  5. Fleur Mougin
  DetailsPDF
• Probabilistic Reasoning within Answer Set Programming with Quantifiers.

  1. Damiano Azzolini
  2. Giuseppe Mazzotta
  3. Francesco Ricca
  DetailsPDF
• Suspending Judgement: Belief Contraction in Dynamic Epistemic Logic.

  1. Alexandru Baltag
  2. Virginie Fiutek
  3. Sonja Smets
  DetailsPDF
• Counting Complexity of ASP.

  1. Max Bannach
  2. Johannes K. Fichte
  3. Johanna Groven
  4. Markus Hecher
  DetailsPDF
• Complexity of Logics with Semiring Semantics.

  1. Timon Barlag
  2. Nicolas Fröhlich
  3. Teemu Hankala
  4. Miika Hannula
  5. Minna Hirvonen
  6. Vivian Holzapfel
  7. Juha Kontinen
  8. Arne Meier
  9. Laura Strieker
  DetailsPDF
• Efficient Incremental #SAT via Cross-Instance Knowledge Reuse.

  1. Uriya Bartal
  2. Dror Fried
  3. Jean-Marie Lagniez
  DetailsPDF
• But Not Because You Said So! Implicitly Accepting Information with Abductive Belief-Base Change.

  1. Moritz Bayerkuhnlein
  2. Özgür Lütfü Özcep
  3. Diedrich Wolter
  DetailsPDF
• Elucidating Arguments Maps in Propositional Logic: Addressing Enthymemes and their Relationships.

  1. Jonathan Ben-Naim
  2. Victor David
  3. Anthony Hunter
  DetailsPDF
• Splitting Argumentation Frameworks with Collective Attacks and Supports.

  1. Matti Berthold
  2. Lydia Blümel
  3. Giovanni Buraglio
  4. Anna Rapberger
  DetailsPDF
• Using ASP(Q) to Handle Inconsistent Prioritized Data.

  1. Meghyn Bienvenu
  2. Camille Bourgaux
  3. Robin Jean
  4. Giuseppe Mazzotta
  DetailsPDF
• How Hard is it to Decide if a Fact is Relevant to a Query?.

  1. Meghyn Bienvenu
  2. Diego Figueira
  3. Pierre Lafourcade
  DetailsPDF
• Why(-Not)-Provenance for Datalog with Negation.

  1. Bart Bogaerts
  2. Marco Calautti
  3. Andreas Pieris
  4. Samuele Pollaci
  5. Robbe Van den Eede
  DetailsPDF
• Interval Orders, Biorders and Credibility-limited Belief Revision.

  1. Richard Booth
  2. Ivan Varzinczak
  DetailsPDF
• Splitting Assumption-Based Argumentation Frameworks.

  1. Giovanni Buraglio
  2. Wolfgang Dvořák
  3. Stefan Woltran
  DetailsPDF
• Voting Compilation Revisited.

  1. Yann Chevaleyre
  2. Jérôme Lang
  3. Nicolas Maudet
  DetailsPDF
• Finding Nash Stable Coalitions under Membership Rights in Boolean Hedonic Games.

  1. Ari Conati
  2. Andreas Niskanen
  3. Ronald de Haan
  4. Matti Järvisalo
  DetailsPDF
• Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification.

  1. Konrad K. Dabrowski
  2. Peter Jonsson
  3. Sebastian Ordyniak
  4. George Osipov
  5. Jorke M. de Vlas
  DetailsPDF
• Reactive Synthesis for Golog Specifications in the Propositional Situation Calculus.

  1. Giuseppe De Giacomo
  2. Yves Lespérance
  3. Matteo Mancanelli
  4. Gianmarco Parretti
  DetailsPDF
• Synthesis Foundations for Online LTLf Goal Management.

  1. Giuseppe De Giacomo
  2. Yves Lespérance
  3. Gianmarco Parretti
  4. Fabio Patrizi
  DetailsPDF
• Simple Guess-and-Check Programs: Strong and Uniform Equivalence Meet Again.

  1. Wolfgang Dvořák
  2. Zeynep G. Saribatur
  3. Stefan Woltran
  DetailsPDF
• Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach.

  1. Leif Eriksson
  2. Victor Lagerkvist
  3. Sebastian Ordyniak
  4. George Osipov
  5. Fahad Panolan
  6. Mateusz Rychlicki
  DetailsPDF
• A Normal Form for Rules Containing Arithmetic Operations.

  1. Jorge Fandinno
  2. Yuliya Lierler
  3. Vladimir Lifschitz
  DetailsPDF
• Probabilistic Abduction in a Fuzzy Logic Framework.

  1. Tommaso Flaminio
  2. Katsumi Inoue
  3. Daniil Kozhemiachenko
  DetailsPDF
• I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems.

  1. Rustam Galimullin
  2. Hermine Grosinger
  3. Munyque Mittelmann
  DetailsPDF
• Hierarchical Models of Multi-Agent Systems: Strategic Ability and Model Checking.

  1. Rustam Galimullin
  2. Wojciech Jamroga
  3. Damian Kurpiewski
  4. Vadim Malvone
  5. Aniello Murano
  DetailsPDF
• The Chase in Lean - Crafting a Formal Library for Existential Rule Research.

  1. Lukas Gerlach
  DetailsPDF
• Over All, PDDL Semantics is Simultaneously Simple and Hard to Get Right.

  1. Nicola Gigante
  2. Andrea Micheli
  3. Enrico Scala
  4. Alessandro Valentini
  DetailsPDF
• Partially Finite Model Reasoning in Description Logics.

  1. Tomasz Gogacz
  2. Filip Murlak
  3. Marcin Przybyłko
  4. Alexandra Rogova
  5. Michał Skrzypczak
  DetailsPDF
• Fitting Horn DL Ontologies to ABox and Query Examples: A Tale of Simulation Quantifiers and Finite Models.

  1. Marvin Grosser
  2. Carsten Lutz
  DetailsPDF
• ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics.

  1. Anselm Haak
  2. Patrick Koopmann
  3. Yasir Mahmood
  4. Anni-Yasmin Turhan
  DetailsPDF
• Safely Decomposing Conditional Belief Bases Into c-LEG Networks.

  1. Gabriele Kern-Isberner
  2. Alexander Hahn
  3. Lars-Phillip Spiegel
  4. Marco Wilhelm
  5. Christoph Beierle
  DetailsPDF
• Beyond Uniform: To Boldly Abstract What Has Not Been Abstracted Before.

  1. Matthias Knorr
  2. Zeynep G. Saribatur
  3. Ricardo Gonçalves
  DetailsPDF
• Representation Theorems for Cumulative Propositional Dependence Logics.

  1. Juha Kontinen
  2. Arne Meier
  3. Kai Sauerwald
  DetailsPDF
• Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic.

  1. Daniil Kozhemiachenko
  2. Igor Sedlár
  DetailsPDF
• A Logic of Limited Belief with Introspection Based on Possible Worlds.

  1. Gerhard Lakemeyer
  2. Hector J. Levesque
  DetailsPDF
• Cops Only Need Factual Knowledge to Catch Robbers.

  1. Dazhu Li
  2. Sujata Ghosh
  DetailsPDF
• Revealed Epistemic Trust.

  1. Xu Li
  2. Leon van der Torre
  3. Liuwen Yu
  DetailsPDF
• Reasoning about Welfare-Affecting Capabilities in Concurrent Games.

  1. Yinfeng Li
  2. Emiliano Lorini
  DetailsPDF
• Almost Certain Query Answering over Incomplete Relational and Graph Data.

  1. Heng Liu
  2. Leonid Libkin
  3. Eugenia Ternovska
  DetailsPDF
• Computational Complexity in Timed Argumentation Frameworks.

  1. Jean-Guy Mailly
  2. Frédéric Maris
  3. Johannes P. Wallner
  DetailsPDF
• Efficient Temporal Datalog Materialisation for Composite Event Recognition.

  1. Periklis Mantenoglou
  DetailsPDF
• Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets.

  1. Sergei Obiedkov
  2. Barış Sertkaya
  DetailsPDF
• Static Analysis of Recursive SHACL.

  1. Anouk Michelle Oudshoorn
  2. Magdalena Ortiz
  3. Mantas Šimkus
  DetailsPDF
• Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics.

  1. Xavier Parent
  DetailsPDF
• From Tensor Networks to Tractable Circuits, and Back.

  1. Arend-Jan Quist
  2. Marc Farreras
  3. Alexis de Colnet
  4. John van de Wetering
  5. Alfons Laarman
  DetailsPDF
• On Sufficient Conditions for Consistency Checking in CP-theory Preferences.

  1. Erik Rauer
  2. Samik Basu
  DetailsPDF
• Expressiveness of Epistemic Spaces for Iterated Belief Change Operators.

  1. Nicolas Schwind
  2. Sébastien Konieczny
  3. Ramón Pino Pérez
  DetailsPDF
• Truth-Tracking by Iterated Belief Change.

  1. Nicolas Schwind
  2. Patricia Everaere
  3. Sébastien Konieczny
  DetailsPDF
• Time Robustness for Point-Based Semantics of Metric Interval Temporal Logic.

  1. Simone Silvetti
  2. Ivan Compagnucci
  3. Francesca Cairoli
  4. Catia Trubiani
  5. Laura Nenzi
  DetailsPDF
• Compiling Defeasible Inference: A Dynamic Approach To System Z.

  1. Luke Slater
  2. Thomas Meyer
  3. Jesse Heyninck
  DetailsPDF
• A Study of Belief Revision Postulates in Multi-Agent Systems.

  1. Michael Thielscher
  2. Tran Cao Son
  DetailsPDF
• Belief Function Propagation in Quantitative Bipolar Argumentation Frameworks.

  1. Jordan Thieyre
  2. Aurélie Beynier
  3. Sébastien Destercke
  4. Nicolas Maudet
  5. Srdjan Vesic
  DetailsPDF
• Proof-Search for Normative and Doxastic Reasoning and Its Use in Logical Argumentation.

  1. Kees van Berkel
  2. Andrea Sabatini
  DetailsPDF
• Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas.

  1. Fabian Vehlken
  2. Thomas Zeume
  3. Emilio Carrasco Bustamante
  4. Maëlle Cornély
  5. Lukas Pradel
  DetailsPDF
• Learning Numeric Planning Domain Models From Positive Observations.

  1. Omar Watted
  2. Argaman Mordoch
  3. Roni Stern
  DetailsPDF
• Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework.

  1. Sheng Wei
  2. Yulin Chen
  3. Beishui Liao
  DetailsPDF
• Contestability in Edge-Weighted Quantitative Bipolar Argumentation Frameworks.

  1. Xiang Yin
  2. Nico Potyka
  3. Antonio Rago
  4. Timotheus Kampik
  5. Francesca Toni
  DetailsPDF
• A Probabilistic Framework for Hierarchical Goal Recognition.

  1. Chenyuan Zhang
  2. Katherine Ip
  3. Hamid Rezatofighi
  4. Buser Say
  5. Mor Vered
  DetailsPDF

KR in the Wild

• Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis.

  1. Mutsunori Banbara
  2. Hideo Bannai
  3. Takashi Horiyama
  4. Dominik Köppl
  5. Takuya Mieno
  6. Hidetomo Nabeshima
  DetailsPDF
• AIGLE: A Tool for Compact, Legible AIGER Circuits from Safety Specifications.

  1. Matías Brizzio
  2. Andoni Rodríguez
  3. César Sánchez
  4. Renzo Degiovanni
  DetailsPDF
• Optimal In-Station Train Dispatching via Symbolic Pattern Planning.

  1. Matteo Cardellini
  2. Enrico Giunchiglia
  3. Davide Anguita
  4. Carmelo Lofiego
  5. Luca Oneto
  6. Pietro Ratto
  DetailsPDF
• Evaluating LLM-Driven Summarisation of Parliamentary Debates with Computational Argumentation.

  1. Eoghan Cunningham
  2. James Cross
  3. Derek Greene
  4. Antonio Rago
  DetailsPDF
• BAss: Symbolic Reasoning in Abstract Dialectical Frameworks.

  1. Samuel Pastva
  2. Van-Giang Trinh
  DetailsPDF
• SAT-based ASP Solving and Optimization via a General Transitive Closure Framework.

  1. Masood Feyzbakhsh Rankooh
  2. Matti Järvisalo
  DetailsPDF
• SRIP: A SAT-based System for Independent Set Reconfiguration.

  1. Takehide Soh
  2. Akifumi Kuwahara
  3. Mutsunori Banbara
  4. Naoyuki Tamura
  5. Yasuaki Kobayashi
  6. Yuta Nozaki
  7. Takehiro Ito
  DetailsPDF
• Efficient Temporal Reasoning with Non-Temporal Engines: Embedding DatalogMTL into Datalog.

  1. Mathijs van Noort
  2. Przemysław Andrzej Wałęga
  DetailsPDF
• A Distributed Framework for Compiling and Reasoning with d-DNNF.

  1. Zhenghang Xu
  2. Minghao Yin
  3. Jianan Wang
  4. Jean-Marie Lagniez
  DetailsPDF

KR meets Machine Learning and Explanation

• A Map–Summarize Framework for Answer Set Verbalization.

  1. Mario Alviano
  2. Matteo Capalbo
  3. Sebastiano A. Piccolo
  DetailsPDF
• A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees.

  1. Gilles Audemard
  2. Sylvie Coste-Marquis
  3. Pierre Marquis
  4. Mehdi Sabiri
  5. Nicolas Szczepanski
  DetailsPDF
• VADAOrchestra: Neurosymbolic Orchestration of Adaptive Reasoning Workflows.

  1. Teodoro Baldazzi
  2. Luigi Bellomarini
  3. Andrea Coletta
  4. Michela Iezzi
  5. Carsten Maple
  6. Alessandro Pesare
  7. Emanuel Sallinger
  DetailsPDF
• Recurrent Graph Neural Networks and Arithmetic Circuits.

  1. Timon Barlag
  2. Vivian Holzapfel
  3. Laura Strieker
  4. Jonni Virtema
  5. Heribert Vollmer
  DetailsPDF
• ABD: Default–Exception Abduction in Finite First-Order Worlds.

  1. Serafim Batzoglou
  DetailsPDF
• Large Language Models as Nondeterministic Causal Models.

  1. Sander Beckers
  DetailsPDF
• Logic of Hypotheses: from Zero to Full Knowledge in Neurosymbolic Integration.

  1. Davide Bizzaro
  2. Alessandro Daniele
  DetailsPDF
• Explaining Classification Through Global Sufficient Reasons and its Complexity.

  1. Marco Calautti
  2. Enrico Malizia
  3. Cristian Molinaro
  DetailsPDF
• Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable.

  1. Artem Chernobrovkin
  2. Marco Sälzer
  3. François Schwarzentruber
  4. Nicolas Troquard
  DetailsPDF
• Gradient-Based Optimization on Gödel Logic as Discrete Local Search.

  1. Alessandro Daniele
  2. Emile van Krieken
  DetailsPDF
• X-ABALearn: Argumentative Learning with Semantics à la Carte.

  1. Emanuele De Angelis
  2. Maurizio Proietti
  3. Francesca Toni
  DetailsPDF
• Argumentation for Explainable and Globally Contestable Decision Support with LLMs.

  1. Adam Dejl
  2. Matthew Williams
  3. Francesca Toni
  DetailsPDF
• Learning Lifted Action Models from Traces with Minimal Information About Actions and States.

  1. Jonas Gösgens
  2. Niklas Jansen
  3. Hector Geffner
  DetailsPDF
• Semantic Foundations of Neuro-Symbolic Multi-Agent Systems.

  1. Julian Gutierrez
  DetailsPDF
• SC²: Safe Control via Shielding for CPCTL Specifications.

  1. Edwin Hamel-De le Court
  2. Gaspard Ohlmann
  3. Francesco Belardinelli
  DetailsPDF
• How Aggregation Functions Affect the Uniform Expressiveness of Graph Neural Networks.

  1. Stan P Hauke
  2. Przemysław Andrzej Wałęga
  DetailsPDF
• Precise and Efficient Model-Agnostic Explanations.

  1. Jairo A. Lefebre-Lobaina
  2. Maria Vanina Martinez
  3. Joao Marques-Silva
  DetailsPDF
• Generating Explainable Counterfactual Policies through Temporal Logic Queries.

  1. Arnaud Lequen
  2. Clément Legrand-Lixon
  3. Léo Saulières
  DetailsPDF
• DeepEL: Deep Learning and Formal Description Logic Reasoning.

  1. Alessandro Longato
  2. Ignacio Huitzil
  3. Rafael Peñaloza
  DetailsPDF
• BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization.

  1. Bruno F. Lourenço
  2. Hesham Morgan
  3. Ana Ozaki
  4. Aleksandar Pavlović
  5. Emanuel Sallinger
  DetailsPDF
• Do Transformers Learn What Theory Predicts? Knowledge Representation-Guided Mechanistic Verification via Causal Abstraction.

  1. Chang Lu
  2. Renate A. Schmidt
  3. Yizheng Zhao
  DetailsPDF
• Unifying Approach to Uniform Expressivity of Graph Neural Networks.

  1. Huan Luo
  2. Jonni Virtema
  DetailsPDF
• A Simple Baseline for Inductive Knowledge Base Completion.

  1. Christian Meilicke
  2. Rainer Gemulla
  3. Julie Naegelen
  4. Heiner Stuckenschmidt
  DetailsPDF
• Model-Agnostic Explanations by Consensus.

  1. Carlos Mencía
  2. Ramon Béjar
  3. Raúl Mencía
  4. Joao Marques-Silva
  DetailsPDF
• Scalable Learning of Challenging Normative Behaviours with Deep RL.

  1. Emery Neufeld
  2. Thorsten Engesser
  3. Martin Tappler
  DetailsPDF
• Normative Narrator: Guiding and Explaining Reinforcement Learning Agents.

  1. Emery Neufeld
  2. Kees van Berkel
  DetailsPDF
• From Next Token Prediction to (STRIPS) World Models.

  1. Carlos Núñez-Molina
  2. Vicenç Gómez
  3. Hector Geffner
  DetailsPDF
• Learnable Multi-Attribute Gradual Semantics for Predicting Persuasion in Argumentative Debates.

  1. Nino Pireaud
  2. Victor David
  3. Anthony Hunter
  4. Pierre Monnin
  5. Elena Cabrio
  DetailsPDF
• ALM–ASP: A Functional Agentic Architecture for Answer Set Programming.

  1. Luis Angel Rodriguez Reiners
  2. Alice Tarzariol
  3. Mario Alviano
  4. Manuel Borroto Santana
  5. Konstantin Schekotihin
  DetailsPDF
• SafeTap: Trustworthy Neurosymbolic Language to Quadrupedal Locomotion via Shield Synthesis Modulo Bitvectors.

  1. Andoni Rodríguez
  2. César Sánchez
  DetailsPDF
• The Polynomial Counting Capabilities of Message Passing Neural Networks.

  1. Marco Sälzer
  2. Pascal Bergsträßer
  3. Anthony W. Lin
  DetailsPDF
• Constraint-Based Analysis of Reasoning Shortcuts in Neurosymbolic Learning.

  1. Akihiro Takemura
  2. Katsumi Inoue
  3. Masaaki Nishino
  DetailsPDF
• Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic.

  1. Manuel Vargas Guzmán
  2. Jakub Szymanik
  3. Maciej Malicki
  DetailsPDF
• Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement.

  1. Stylianos Loukas Vasileiou
  2. Minh Nguyen
  3. Tran Cao Son
  4. Huiping Cao
  5. Enrico Pontelli
  DetailsPDF
• Symbolic Knowledge Transfer for Sample-Efficient Deep Reinforcement Learning.

  1. Celeste Veronese
  2. Alessandro Farinelli
  3. Daniele Meli
  DetailsPDF
• RegD: Hierarchical Embeddings via Dissimilarity between Arbitrary Euclidean Regions.

  1. Hui Yang
  2. Jiaoyan Chen
  DetailsPDF
• Neuro-Symbolic Causal Boosting: A Framework for Interpretable Attribution of Business Fluctuations.

  1. Yonghe Zhao
  2. Yuezhu Wang
  3. Chao Ma
  4. Huiyan Sun
  DetailsPDF