KR2025Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning

Main Track

• Model Checking Linear Temporal Logic with Standpoint Modalities.

  1. Rajab Aghamov
  2. Christel Baier
  3. Toghrul Karimov
  4. Rupak Majumdar
  5. Joël Ouaknine
  6. Jakob Piribauer
  7. Timm Spork
  DetailsPDF
• Presburger Functional Synthesis: Complexity and Tractable Normal Forms.

  1. S. Akshay
  2. A. R. Balasubramanian
  3. Supratik Chakraborty
  4. Georg Zetzsche
  DetailsPDF
• Extending Abstract Argumentation Frameworks with Knowledge Bases.

  1. Gianvincenzo Alfano
  2. Sergio Greco
  3. Cristian Molinaro
  4. Francesco Parisi
  5. Irina Trubitsyna
  DetailsPDF
• Axiomatic Characterisations of Argumentation Semantics.

  1. Leila Amgoud
  DetailsPDF
• Compactness and Preservation in Logical Argumentation Frameworks.

  1. Ofer Arieli
  2. Christian Strasser
  DetailsPDF
• Reasoning with Restricted Statistical Statements in Probabilistic Answer Set Programming: Complexity and Algorithms.

  1. Damiano Azzolini
  2. Markus Hecher
  DetailsPDF
• A Novel Framework for Reasoning over Optimization Problems in Probabilistic Answer Set Programming.

  1. Damiano Azzolini
  2. Giuseppe Mazzotta
  3. Francesco Ricca
  4. Fabrizio Riguzzi
  DetailsPDF
• Counting Solutions Under Cardinality Constraints: Structure Counts in Counting.

  1. Max Bannach
  2. Markus Hecher
  DetailsPDF
• Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards.

  1. Bartosz Bednarczyk
  2. Emanuel Kieroński
  DetailsPDF
• FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding.

  1. Alexander Beiser
  2. Martin Gebser
  3. Markus Hecher
  4. Stefan Woltran
  DetailsPDF
• An Axiomatic Study of a Modular Evaluation of Enthymeme Decoding in Weighted Structured Argumentation.

  1. Jonathan Ben-Naim
  2. Victor David
  3. Anthony Hunter
  DetailsPDF
• Sequence Explanations for Acceptance in Abstract Argumentation.

  1. Lars Bengel
  2. Matthias Thimm
  DetailsPDF
• A Reduct-based Approach to Skeptical Preferred Reasoning in Abstract Argumentation.

  1. Lars Bengel
  2. Julian Sander
  3. Matthias Thimm
  DetailsPDF
• On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation.

  1. Matti Berthold
  2. Lydia Blümel
  3. Anna Rapberger
  DetailsPDF
• Strategy Logic, Imperfect Information, and Hyperproperties.

  1. Raven Beutner
  2. Bernd Finkbeiner
  DetailsPDF
• Tractable Responsibility Measures for Ontology-Mediated Query Answering.

  1. Meghyn Bienvenu
  2. Diego Figueira
  3. Pierre Lafourcade
  DetailsPDF
• A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases.

  1. Meghyn Bienvenu
  2. Camille Bourgaux
  3. Katsumi Inoue
  4. Robin Jean
  DetailsPDF
• Halting Recurrent GNNs and the Graded mu-Calculus.

  1. Jeroen Bollen
  2. Jan Van den Bussche
  3. Stijn Vansummeren
  4. Jonni Virtema
  DetailsPDF
• An Intuitionistic Version of Alternating-Time Temporal Logic.

  1. Laura Bozzelli
  2. Andrea Capone
  3. Davide Catta
  4. Aniello Murano
  DetailsPDF
• Finite Axiomatizability by Disjunctive Existential Rules.

  1. Marco Calautti
  2. Marco Console
  3. Andreas Pieris
  DetailsPDF
• On the Complexity of Global Necessary Reasons to Explain Classification.

  1. Marco Calautti
  2. Enrico Malizia
  3. Cristian Molinaro
  DetailsPDF
• Reasoning in Defeasible Description Logics with System W and Lexicographic Inference.

  1. Giovanni Casini
  2. Jonas Haldimann
  3. Thomas Meyer
  DetailsPDF
• How Lucky Are You to Know Your Way? A Probabilistic Approach to Knowing How Logics.

  1. Pablo F. Castro
  2. Pedro R. D'Argenio
  3. Raul Fervari
  DetailsPDF
• Boolean Nearest Neighbor Language in the Knowledge Compilation Map.

  1. Ondřej Čepek
  2. Jelena Glišić
  DetailsPDF
• Belief Revision in a Probabilistic Setting.

  1. James P. Delgrande
  2. Gerhard Lakemeyer
  3. Maurice Pagnucco
  4. Joshua Sack
  DetailsPDF
• On the Effects of Adding Assignments in Linear-Time Temporal Logics Modulo Theories.

  1. Stéphane Demri
  2. Raul Fervari
  DetailsPDF
• Minimal Model Reasoning in Description Logics: Don’t Try This at Home!.

  1. Federica Di Stefano
  2. Quentin Manière
  3. Magdalena Ortiz
  4. Mantas Šimkus
  DetailsPDF
• Grounding Rule-Based Argumentation Using Datalog.

  1. Martin Diller
  2. Sarah Alice Gaggl
  3. Philipp Hanisch
  4. Giuseppina Monterosso
  5. Fritz Rauschenbach
  DetailsPDF
• An Information-Flow Perspective on Explainability Requirements: Specification and Verification.

  1. Bernd Finkbeiner
  2. Hadar Frenkel
  3. Julian Siber
  DetailsPDF
• Categorical Explaining Functors: Ensuring Coherence in Logical Explanations.

  1. Stefano Fioravanti
  2. Francesco Giannini
  3. Pietro Barbiero
  4. Paolo Frazzetto
  5. Roberto Confalonieri
  6. Fabio Zanasi
  7. Nicolò Navarin
  DetailsPDF
• Two-Variable Logic for Hierarchically Partitioned and Ordered Data.

  1. Oskar Fiuk
  2. Emanuel Kieroński
  3. Vincent Michielini
  DetailsPDF
• A Logic-Based Framework for Database Repairs.

  1. Nicolas Fröhlich
  2. Arne Meier
  3. Nina Pardal
  4. Jonni Virtema
  DetailsPDF
• Fitting Description Logic Ontologies to ABox and Query Examples.

  1. Maurice Funk
  2. Marvin Grosser
  3. Carsten Lutz
  DetailsPDF
• About the Multi-Head Linear Restricted Chase Termination.

  1. Lukas Gerlach
  2. Lucas Larroque
  3. Jerzy Marcinkowski
  4. Piotr Ostropolski-Nalewaja
  DetailsPDF
• Reasoning About Knowledge on Regular Expressions Is 2EXPTIME-Complete.

  1. Avijeet Ghosh
  2. Sujata Ghosh
  3. François Schwarzentruber
  DetailsPDF
• Putting Perspective into OWL [Sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic.

  1. Lucía Gómez Álvarez
  2. Sebastian Rudolph
  DetailsPDF
• A Framework for Inconsistency-tolerant Reasoning with Sets of Models.

  1. Yehia Hatab
  2. Kai Sauerwald
  3. Matthias Thimm
  DetailsPDF
• Repairing General Game Descriptions.

  1. Yifan He
  2. Munyque Mittelmann
  3. Aniello Murano
  4. Abdallah Saffidine
  5. Michael Thielscher
  DetailsPDF
• An Analysis of the Role of Syntax in Inductive Inference.

  1. Jesse Heyninck
  2. Richard Booth
  3. Thomas Meyer
  4. Lars-Phillip Spiegel
  DetailsPDF
• Fitting Ontologies and Constraints to Relational Structures.

  1. Simon Hosemann
  2. Jean Christoph Jung
  3. Carsten Lutz
  4. Sebastian Rudolph
  DetailsPDF
• Complexity of Abduction in Łukasiewicz Logic.

  1. Katsumi Inoue
  2. Daniil Kozhemiachenko
  DetailsPDF
• Effective AGM Belief Contraction: A Journey Beyond the Finitary Realm.

  1. Dominik Klumpp
  2. Jandson S. Ribeiro
  DetailsPDF
• Abstractions of Queries in Ontology-Based Data Access.

  1. Michel Leclère
  2. Marie-Laure Mugnier
  3. Guillaume Pérution-Kihli
  DetailsPDF
• An Epistemic Theory of Deductive Arguments.

  1. Emiliano Lorini
  DetailsPDF
• Non-deterministic Action Reversibility: Complexity Results.

  1. Jakub Med
  2. Michael Morak
  3. Lukáš Chrpa
  4. Wolfgang Faber
  DetailsPDF
• Solving Unification in the Description Logic FL_bottom.

  1. Barbara Morawska
  2. Dariusz Marzec
  DetailsPDF
• Logical Expressivity and Explanations for Monotonic GNNs with Scoring Functions.

  1. Matthew Morris
  2. David J. Tena Cucala
  3. Bernardo Cuenca Grau
  DetailsPDF
• Faithful Differentiable Reasoning with Reshuffled Region-based Embeddings.

  1. Aleksandar Pavlovic
  2. Emanuel Sallinger
  3. Steven Schockaert
  DetailsPDF
• A Methodology for Incompleteness-Tolerant and Modular Gradual Semantics for Argumentative Statement Graphs.

  1. Antonio Rago
  2. Stylianos Loukas Vasileiou
  3. Son Tran
  4. Francesca Toni
  5. William Yeoh
  DetailsPDF
• On Gradual Semantics for Assumption-Based Argumentation.

  1. Anna Rapberger
  2. Fabrizio Russo
  3. Antonio Rago
  4. Francesca Toni
  DetailsPDF
• On the Complexity and Properties of Preferential Propositional Dependence Logic.

  1. Kai Sauerwald
  2. Arne Meier
  3. Juha Kontinen
  DetailsPDF
• Context-Based Belief Revision.

  1. Nicolas Schwind
  DetailsPDF
• Efficient Volume Computation for SMT Formulas.

  1. Arijit Shaw
  2. Uddalok Sarkar
  3. Kuldeep S. Meel
  DetailsPDF
• A Principle-based Framework for Analyzing Dialogue Game-based Semantics.

  1. Yamil O. Soto
  2. Andrea Cohen
  3. Cristhian Ariel D. Deagustini
  4. Maria Vanina Martinez
  5. Gerardo I. Simari
  DetailsPDF
• Pushdown Reward Machines for Reinforcement Learning.

  1. Giovanni Varricchione
  2. Toryn Q. Klassen
  3. Natasha Alechina
  4. Mehdi Dastani
  5. Brian Logan
  6. Sheila A. McIlraith
  DetailsPDF

KR in the Wild

• Exploring Desirable Configurations in Global Logistics with Heuristic Search in Answer Set Programming.

  1. Olcay Altay-Kern
  2. Emmanuelle Dietz
  3. Isabelle Kuhlmann
  4. Matthias Thimm
  DetailsPDF
• Model Checker for Recursive Aggregates.

  1. Mario Alviano
  2. Carmine Dodaro
  3. Salvatore Fiorentino
  DetailsPDF
• Interactive Exploration of Plan Spaces.

  1. Daniel Gnad
  2. Markus Hecher
  3. Sarah Alice Gaggl
  4. Dominik Rusovac
  5. David Speck
  6. Johannes K. Fichte
  DetailsPDF
• Reasoning About Actual Causality in Answer Set Programming.

  1. Daniel Özcan
  2. Dalal Alrajeh
  3. Robert Craven
  DetailsPDF
• Can LLMs Solve ASP Problems? Insights from a Benchmarking Study.

  1. Lin Ren
  2. Guohui Xiao
  3. Guilin Qi
  4. Yishuai Geng
  5. Haohan Xue
  DetailsPDF
• ASP-Driven Visual Commonsense: A General Framework for Reasoning About Embodied Interaction in the Wild.

  1. Jakob Suchan
  2. Mehul Bhatt
  3. Julius Monsen
  DetailsPDF
• A Tensor-Based Probabilistic Event Calculus.

  1. Efthimis Tsilionis
  2. Alexander Artikis
  3. Georgios Paliouras
  DetailsPDF
• TRACE-CS: A Hybrid Logic–LLM System for Explainable Course Scheduling.

  1. Stylianos Loukas Vasileiou
  2. William Yeoh
  DetailsPDF
• Advances in Logic-Based Entity Resolution: Enhancing ASPEN with Local Merges and Optimality Criteria.

  1. Zhiliang Xiang
  2. Meghyn Bienvenu
  3. Gianluca Cima
  4. Víctor Gutiérrez-Basulto
  5. Yazmín Ibáñez-García
  DetailsPDF
• An Embarrassingly Parallel Model Counter.

  1. Zhenghang Xu
  2. Minghao Yin
  3. Jean Marie Lagniez
  DetailsPDF

KR and Constraints

• Expressive Description Logics with Rich Yet Affordable Numeric Constraints.

  1. Federica Di Stefano
  2. Sanja Lukumbuzya
  3. Magdalena Ortiz
  4. Mantas Šimkus
  DetailsPDF
• Counterexample-Guided Abstraction Refinement for Assumption-based Argumentation.

  1. Jean Marie Lagniez
  2. Emmanuel Lonca
  3. Jean-Guy Mailly
  DetailsPDF
• Reasoning in Assumption-Based Argumentation via SAT.

  1. Andreas Niskanen
  2. Masood Feyzbakhsh Rankooh
  3. Tuomo Lehtonen
  4. Matti Järvisalo
  DetailsPDF

KR in Planning and Scheduling

• LTL Synthesis Under Multi-Agent Environment Assumptions.

  1. Benjamin Aminof
  2. Giuseppe De Giacomo
  3. Giuseppe Perelli
  4. Sasha Rubin
  DetailsPDF
• Depth-Bounded Epistemic Planning.

  1. Thomas Bolander
  2. Alessandro Burigana
  3. Marco Montali
  DetailsPDF
• Learning General Policies from Examples.

  1. Blai Bonet
  2. Hector Geffner
  DetailsPDF
• Automated Planning with Ontologies Under Coherence Update Semantics.

  1. Stefan Borgwardt
  2. Duy Nhu
  3. Gabriele Röger
  DetailsPDF
• Pushing the Envelope in Numeric Pattern Planning.

  1. Matteo Cardellini
  2. Enrico Giunchiglia
  DetailsPDF
• Pruning with Belief Traps in Multi-agent Epistemic Planning.

  1. Biqing Fang
  2. Fangzhen Lin
  DetailsPDF
• Cost-Optimal Delete-Free Classical Planning via Maximum Satisfiability.

  1. Masood Feyzbakhsh Rankooh
  2. Andreas Niskanen
  3. Matti Järvisalo
  DetailsPDF
• Counterfactual Scenarios for Automated Planning.

  1. Nicola Gigante
  2. Francesco Leofante
  3. Andrea Micheli
  DetailsPDF
• Domain-Independent Instance Generation for Classical Planning.

  1. Claudia Grundke
  2. Malte Helmert
  3. Gabriele Röger
  DetailsPDF
• Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis.

  1. Daniel Hausmann
  2. Shufang Zhu
  3. Gianmarco Parretti
  4. Christoph Weinhuber
  5. Giuseppe De Giacomo
  6. Nir Piterman
  DetailsPDF
• Representing Perfect Saturated Cost Partitioning Heuristics in Classical Planning.

  1. Paul Höft
  2. David Speck
  3. Jendrik Seipp
  DetailsPDF
• Learning Lifted Action Models from Traces of Incomplete Actions and States.

  1. Niklas Jansen
  2. Jonas Gösgens
  3. Hector Geffner
  DetailsPDF
• Generalizing Platform-Aware Mission Planning for Infinite-State Timed Transition Systems.

  1. Stefan Panjkovic
  2. Alessandro Cimatti
  3. Andrea Micheli
  4. Stefano Tonetta
  DetailsPDF
• A Planning Compilation to Reason About Goal Achievement at Planning Time.

  1. Alberto Pozanco
  2. Marianela Morales
  3. Daniel Borrajo
  4. Manuela Veloso
  DetailsPDF
• Explanations for Unrealizability of Infinite-State Safety Shields.

  1. Andoni Rodríguez
  2. Irfansha Shaik
  3. Davide Corsi
  4. Roy Fox
  5. César Sánchez
  DetailsPDF
• Probabilistic HTN Planning: Formalization and Computational Complexity Analysis.

  1. Mohammad Yousefi
  2. Johannes Schmalz
  3. Patrik Haslum
  4. Pascal Bercher
  DetailsPDF
• Probabilistic Active Goal Recognition.

  1. Chenyuan Zhang
  2. Cristian Rojas Cardenas
  3. Hamid Rezatofighi
  4. Mor Vered
  5. Buser Say
  DetailsPDF