PPaperPicks
← All conferences
Editions202620252024

KR 2026

A*

International Conference on Principles of Knowledge Representation and Reasoning

Official site ↗
121
accepted papers
114
authors
July 20-23, 2026
dates
Portugal
location

121 / 121 papers

  1. 1
    A Distributed Framework for Compiling and Reasoning with d-DNNF
    Zhenghang Xu
    DBLP profile ↗ORCID search ↗
  2. 2
    A framework for Counterfactual Explainability in Graph Neural Networks
    Maria Myrto Villia
    DBLP profile ↗ORCID search ↗
  3. 3
    A Logic of Limited Belief with Introspection Based on Possible Worlds
    Gerhard Lakemeyer
    DBLP profile ↗ORCID search ↗
  4. 4
    A Map-Summarize Framework for Answer Set Verbalization
    Mario Alviano
    DBLP profile ↗ORCID search ↗
  5. 5
    A Normal Form for Rules Containing Arithmetic Operations
    Jorge Fandinno
    DBLP profile ↗ORCID search ↗
  6. 6
    A Probabilistic Framework for Hierarchical Goal Recognition
    Chenyuan Zhang
    DBLP profile ↗ORCID search ↗
  7. 7
    A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees
    Gilles Audemard
    DBLP profile ↗ORCID search ↗
  8. 8
    A Simple Baseline for Inductive Knowledge Base Completion
    Christian Meilicke
    DBLP profile ↗ORCID search ↗
  9. 9
    A Study of Belief Revision Postulates in Multi-Agent Systems
    Michael Thielscher
    DBLP profile ↗ORCID search ↗
  10. 10
    ABD: Default-Exception Abduction in Finite First-Order Worlds
    Serafim Batzoglou
    DBLP profile ↗ORCID search ↗
  11. 11
    ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
    Anselm Haak
    DBLP profile ↗ORCID search ↗
  12. 12
    AIGLE: A Tool for Compact, Legible AIGER Circuits from Safety Specifications
    Matías Brizzio
    DBLP profile ↗ORCID search ↗
  13. 13
    ALM-ASP: A Functional Agentic Architecture for Answer Set Programming
    Luis Angel Rodriguez Reiners
    DBLP profile ↗ORCID search ↗
  14. 14
    Almost Certain Query Answering over Incomplete Relational and Graph Data
    Heng Liu
    DBLP profile ↗ORCID search ↗
  15. 15
    Argumentation for Explainable and Globally Contestable Decision Support with LLMs
    Adam Dejl
    DBLP profile ↗ORCID search ↗
  16. 16
    ASP Encodings for the Multi Batching Problem in Logistics Networks
    Racquel Dennison
    DBLP profile ↗ORCID search ↗
  17. 17
    BAss: Symbolic Reasoning in Abstract Dialectical Frameworks
    Samuel Pastva
    DBLP profile ↗ORCID search ↗
  18. 18
    Belief Function Propagation in Quantitative Bipolar Argumentation Frameworks
    Jordan Thieyre
    DBLP profile ↗ORCID search ↗
  19. 19
    Beyond Consistency: A Closer Look at Free Formulas
    Ofer Arieli
    DBLP profile ↗ORCID search ↗
  20. 20
    Beyond Uniform: To Boldly Abstract What Has Not Been Abstracted Before
    Matthias Knorr
    DBLP profile ↗ORCID search ↗
  21. 21
    BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization
    Bruno F. Lourenço
    DBLP profile ↗ORCID search ↗
  22. 22
    But Not Because You Said So! Implicitly Accepting Information with Abductive Belief-Base Change
    Moritz Bayerkuhnlein
    DBLP profile ↗ORCID search ↗
  23. 23
    Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework
    Sheng Wei
    DBLP profile ↗ORCID search ↗
  24. 24
    Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
    Leif Eriksson
    DBLP profile ↗ORCID search ↗
  25. 25
    Common Foundations for Recursive Shape Languages
    Shqiponja Ahmetaj
    DBLP profile ↗ORCID search ↗
  26. 26
    Compiling Defeasible Inference: A Dynamic Approach To System Z
    Luke Slater
    DBLP profile ↗ORCID search ↗
  27. 27
    Complexity of Logics with Semiring Semantics
    Timon Barlag
    DBLP profile ↗ORCID search ↗
  28. 28
    Computational Complexity in Timed Argumentation Frameworks
    Jean-Guy Mailly
    DBLP profile ↗ORCID search ↗
  29. 29
    Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
    Sergei Obiedkov
    DBLP profile ↗ORCID search ↗
  30. 30
    Constraint-Based Analysis of Reasoning Shortcuts in Neurosymbolic Learning
    Akihiro Takemura
    DBLP profile ↗ORCID search ↗
  31. 31
    Contestability in Edge-Weighted Quantitative Bipolar Argumentation Frameworks
    Xiang Yin
    DBLP profile ↗ORCID search ↗
  32. 32
    Cops Only Need Factual Knowledge to Catch Robbers
    Dazhu Li
    DBLP profile ↗ORCID search ↗
  33. 33
    Counting Complexity of ASP
    Max Bannach
    DBLP profile ↗ORCID search ↗
  34. 34
    DeepEL: Deep Learning and Formal Description Logic Reasoning
    Alessandro Longato
    DBLP profile ↗ORCID search ↗
  35. 35
    Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics
    Xavier Parent
    DBLP profile ↗ORCID search ↗
  36. 36
    Do Transformers Learn What Theory Predicts? Knowledge Representation-Guided Mechanistic Verification via Causal Abstraction
    Chang Lu
    DBLP profile ↗ORCID search ↗
  37. 37
    Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
    Uriya Bartal
    DBLP profile ↗ORCID search ↗
  38. 38
    Efficient Temporal Datalog Materialisation for Composite Event Recognition
    Periklis Mantenoglou
    DBLP profile ↗ORCID search ↗
  39. 39
    Efficient Temporal Reasoning with Non-Temporal Engines: Embedding DatalogMTL into Datalog
    Mathijs van Noort
    DBLP profile ↗ORCID search ↗
  40. 40
    Elucidating Arguments Maps in Propositional Logic: Addressing Enthymemes and their Relationships
    Jonathan Ben-Naim
    DBLP profile ↗ORCID search ↗
  41. 41
    Evaluating LLM-Driven Summarisation of Parliamentary Debates with Computational Argumentation
    Eoghan Cunningham
    DBLP profile ↗ORCID search ↗
  42. 42
    Explaining Classification Through Global Sufficient Reasons and its Complexity
    Marco Calautti
    DBLP profile ↗ORCID search ↗
  43. 43
    Expressiveness of Epistemic Spaces for Iterated Belief Change Operators
    Nicolas Schwind
    DBLP profile ↗ORCID search ↗
  44. 44
    Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement
    Stylianos Loukas Vasileiou
    DBLP profile ↗ORCID search ↗
  45. 45
    Finding Nash Stable Coalitions under Membership Rights in Boolean Hedonic Games
    Ari Conati
    DBLP profile ↗ORCID search ↗
  46. 46
    Fitting Horn DL Ontologies to ABox and Query Examples: A Tale of Simulation Quantifiers and Finite Models
    Marvin Grosser
    DBLP profile ↗ORCID search ↗
  47. 47
    From Next Token Prediction to (STRIPS) World Models
    Carlos Núñez-Molina
    DBLP profile ↗ORCID search ↗
  48. 48
    From Tensor Networks to Tractable Circuits, and Back
    Arend-Jan Quist
    DBLP profile ↗ORCID search ↗
  49. 49
    Generalization in Reinforcement Learning from Logical Specifications
    Vignesh Subramanian
    DBLP profile ↗ORCID search ↗
  50. 50
    Generating Explainable Counterfactual Policies through Temporal Logic Queries
    Arnaud Lequen
    DBLP profile ↗ORCID search ↗