default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd KR 2025: Melbourne, Australia
- Magdalena Ortiz, Renata Wassermann, Torsten Schaub:
Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning, KR 2025, Melbourne, Australia, November 1-17, 2025. 2025, ISBN 978-1-956792-08-9
Main Track
- Rajab Aghamov, Christel Baier, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Jakob Piribauer, Timm Spork:
Model Checking Linear Temporal Logic with Standpoint Modalities. - S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche:
Presburger Functional Synthesis: Complexity and Tractable Normal Forms. - Gianvincenzo Alfano, Sergio Greco, Cristian Molinaro, Francesco Parisi, Irina Trubitsyna:
Extending Abstract Argumentation Frameworks with Knowledge Bases. - Leila Amgoud:
Axiomatic Characterisations of Argumentation Semantics. - Ofer Arieli, Christian Straßer:
Compactness and Preservation in Logical Argumentation Frameworks. - Damiano Azzolini, Markus Hecher:
Reasoning with Restricted Statistical Statements in Probabilistic Answer Set Programming: Complexity and Algorithms. - Damiano Azzolini, Giuseppe Mazzotta, Francesco Ricca, Fabrizio Riguzzi:
A Novel Framework for Reasoning over Optimization Problems in Probabilistic Answer Set Programming. - Max Bannach, Markus Hecher:
Counting Solutions Under Cardinality Constraints: Structure Counts in Counting. - Bartosz Bednarczyk, Emanuel Kieronski:
Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards. - Alexander Beiser, Martin Gebser, Markus Hecher, Stefan Woltran:
FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding. - Jonathan Ben-Naim, Victor David, Anthony Hunter:
An Axiomatic Study of a Modular Evaluation of Enthymeme Decoding in Weighted Structured Argumentation. - Lars Bengel, Matthias Thimm:
Sequence Explanations for Acceptance in Abstract Argumentation. - Lars Bengel, Julian Sander, Matthias Thimm:
A Reduct-based Approach to Skeptical Preferred Reasoning in Abstract Argumentation. - Matti Berthold, Lydia Blümel, Anna Rapberger:
On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation. - Raven Beutner, Bernd Finkbeiner:
Strategy Logic, Imperfect Information, and Hyperproperties. - Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
Tractable Responsibility Measures for Ontology-Mediated Query Answering. - Meghyn Bienvenu, Camille Bourgaux, Katsumi Inoue, Robin Jean:
A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases. - Jeroen Bollen, Jan Van den Bussche, Stijn Vansummeren, Jonni Virtema:
Halting Recurrent GNNs and the Graded mu-Calculus. - Laura Bozzelli, Andrea Capone, Davide Catta, Aniello Murano:
An Intuitionistic Version of Alternating-Time Temporal Logic. - Marco Calautti, Marco Console, Andreas Pieris:
Finite Axiomatizability by Disjunctive Existential Rules. - Marco Calautti, Enrico Malizia, Cristian Molinaro:
On the Complexity of Global Necessary Reasons to Explain Classification. - Giovanni Casini, Jonas Haldimann, Thomas Meyer:
Reasoning in Defeasible Description Logics with System W and Lexicographic Inference. - Pablo F. Castro, Pedro R. D'Argenio, Raul Fervari:
How Lucky Are You to Know Your Way? A Probabilistic Approach to Knowing How Logics. - Ondrej Cepek, Jelena Glisic:
Boolean Nearest Neighbor Language in the Knowledge Compilation Map. - James P. Delgrande, Gerhard Lakemeyer, Maurice Pagnucco, Joshua Sack:
Belief Revision in a Probabilistic Setting. - Stéphane Demri, Raul Fervari:
On the Effects of Adding Assignments in Linear-Time Temporal Logics Modulo Theories. - Federica Di Stefano, Quentin Manière, Magdalena Ortiz, Mantas Simkus:
Minimal Model Reasoning in Description Logics: Don't Try This at Home! - Martin Diller, Sarah Alice Gaggl, Philipp Hanisch, Giuseppina Monterosso, Fritz Rauschenbach:
Grounding Rule-Based Argumentation Using Datalog. - Bernd Finkbeiner, Hadar Frenkel, Julian Siber:
An Information-Flow Perspective on Explainability Requirements: Specification and Verification. - Stefano Fioravanti, Francesco Giannini, Pietro Barbiero, Paolo Frazzetto, Roberto Confalonieri, Fabio Zanasi, Nicolò Navarin:
Categorical Explaining Functors: Ensuring Coherence in Logical Explanations. - Oskar Fiuk, Emanuel Kieronski, Vincent Michielini:
Two-Variable Logic for Hierarchically Partitioned and Ordered Data. - Nicolas Fröhlich, Arne Meier, Nina Pardal, Jonni Virtema:
A Logic-Based Framework for Database Repairs. - Maurice Funk, Marvin Grosser, Carsten Lutz:
Fitting Description Logic Ontologies to ABox and Query Examples. - Lukas Gerlach, Lucas Larroque, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
About the Multi-Head Linear Restricted Chase Termination. - Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber:
Reasoning About Knowledge on Regular Expressions Is 2EXPTIME-Complete. - Lucía Gómez Álvarez, Sebastian Rudolph:
Putting Perspective into OWL [Sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic. - Yehia Hatab, Kai Sauerwald, Matthias Thimm:
A Framework for Inconsistency-tolerant Reasoning with Sets of Models. - Yifan He, Munyque Mittelmann, Aniello Murano, Abdallah Saffidine, Michael Thielscher:
Repairing General Game Descriptions. - Jesse Heyninck, Richard Booth, Thomas Meyer, Lars-Phillip Spiegel:
An Analysis of the Role of Syntax in Inductive Inference. - Simon Hosemann, Jean Christoph Jung, Carsten Lutz, Sebastian Rudolph:
Fitting Ontologies and Constraints to Relational Structures. - Katsumi Inoue, Daniil Kozhemiachenko:
Complexity of Abduction in Łukasiewicz Logic. - Dominik Klumpp, Jandson S. Ribeiro:
Effective AGM Belief Contraction: A Journey Beyond the Finitary Realm. - Michel Leclère, Marie-Laure Mugnier, Guillaume Pérution-Kihli:
Abstractions of Queries in Ontology-Based Data Access. - Emiliano Lorini:
An Epistemic Theory of Deductive Arguments. - Jakub Med, Michael Morak, Lukás Chrpa, Wolfgang Faber:
Non-deterministic Action Reversibility: Complexity Results. - Barbara Morawska, Dariusz Marzec:
Solving Unification in the Description Logic FL_bottom. - Matthew Morris, David J. Tena Cucala, Bernardo Cuenca Grau:
Logical Expressivity and Explanations for Monotonic GNNs with Scoring Functions. - Aleksandar Pavlovic, Emanuel Sallinger, Steven Schockaert:
Faithful Differentiable Reasoning with Reshuffled Region-based Embeddings. - Antonio Rago, Stylianos Loukas Vasileiou, Son Tran, Francesca Toni, William Yeoh:
A Methodology for Incompleteness-Tolerant and Modular Gradual Semantics for Argumentative Statement Graphs. - Anna Rapberger, Fabrizio Russo, Antonio Rago, Francesca Toni:
On Gradual Semantics for Assumption-Based Argumentation. - Kai Sauerwald, Arne Meier, Juha Kontinen:
On the Complexity and Properties of Preferential Propositional Dependence Logic. - Nicolas Schwind:
Context-Based Belief Revision. - Arijit Shaw, Uddalok Sarkar, Kuldeep S. Meel:
Efficient Volume Computation for SMT Formulas. - Yamil Osvaldo Soto, Andrea Cohen, Cristhian Ariel David Deagustini, Maria Vanina Martinez, Gerardo I. Simari:
A Principle-based Framework for Analyzing Dialogue Game-based Semantics. - Giovanni Varricchione, Toryn Q. Klassen, Natasha Alechina, Mehdi Dastani, Brian Logan, Sheila A. McIlraith:
Pushdown Reward Machines for Reinforcement Learning.
KR in the Wild
- Olcay Altay-Kern, Emmanuelle Dietz, Isabelle Kuhlmann, Matthias Thimm:
Exploring Desirable Configurations in Global Logistics with Heuristic Search in Answer Set Programming. - Mario Alviano, Carmine Dodaro, Salvatore Fiorentino:
Model Checker for Recursive Aggregates. - Daniel Gnad, Markus Hecher, Sarah Alice Gaggl, Dominik Rusovac, David Speck, Johannes Klaus Fichte:
Interactive Exploration of Plan Spaces. - Daniel Özcan, Dalal Alrajeh, Robert Craven:
Reasoning About Actual Causality in Answer Set Programming. - Lin Ren, Guohui Xiao, Guilin Qi, Yishuai Geng, Haohan Xue:
Can LLMs Solve ASP Problems? Insights from a Benchmarking Study. - Jakob Suchan, Mehul Bhatt, Julius Monsen:
ASP-Driven Visual Commonsense: A General Framework for Reasoning About Embodied Interaction in the Wild. - Efthimis Tsilionis, Alexander Artikis, Georgios Paliouras:
A Tensor-Based Probabilistic Event Calculus. - Stylianos Loukas Vasileiou, William Yeoh:
TRACE-CS: A Hybrid Logic-LLM System for Explainable Course Scheduling. - Zhiliang Xiang, Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García:
Advances in Logic-Based Entity Resolution: Enhancing ASPEN with Local Merges and Optimality Criteria. - Zhenghang Xu, Minghao Yin, Jean-Marie Lagniez:
An Embarrassingly Parallel Model Counter.
KR and Constraints
- Federica Di Stefano, Sanja Lukumbuzya, Magdalena Ortiz, Mantas Simkus:
Expressive Description Logics with Rich Yet Affordable Numeric Constraints. - Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly:
Counterexample-Guided Abstraction Refinement for Assumption-based Argumentation. - Andreas Niskanen, Masood Feyzbakhsh Rankooh, Tuomo Lehtonen, Matti Järvisalo:
Reasoning in Assumption-Based Argumentation via SAT.
KR in Planning and Scheduling
- Benjamin Aminof, Giuseppe De Giacomo, Giuseppe Perelli, Sasha Rubin:
LTL Synthesis Under Multi-Agent Environment Assumptions. - Thomas Bolander, Alessandro Burigana, Marco Montali:
Depth-Bounded Epistemic Planning. - Blai Bonet, Hector Geffner:
Learning General Policies from Examples. - Stefan Borgwardt, Duy Nhu, Gabriele Röger:
Automated Planning with Ontologies Under Coherence Update Semantics. - Matteo Cardellini, Enrico Giunchiglia:
Pushing the Envelope in Numeric Pattern Planning. - Biqing Fang, Fangzhen Lin:
Pruning with Belief Traps in Multi-agent Epistemic Planning. - Masood Feyzbakhsh Rankooh, Andreas Niskanen, Matti Järvisalo:
Cost-Optimal Delete-Free Classical Planning via Maximum Satisfiability. - Nicola Gigante, Francesco Leofante, Andrea Micheli:
Counterfactual Scenarios for Automated Planning. - Claudia Grundke, Malte Helmert, Gabriele Röger:
Domain-Independent Instance Generation for Classical Planning. - Daniel Hausmann, Shufang Zhu, Gianmarco Parretti, Christoph Weinhuber, Giuseppe De Giacomo, Nir Piterman:
Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis. - Paul Höft, David Speck, Jendrik Seipp:
Representing Perfect Saturated Cost Partitioning Heuristics in Classical Planning. - Niklas Jansen, Jonas Gösgens, Hector Geffner:
Learning Lifted Action Models from Traces of Incomplete Actions and States. - Stefan Panjkovic, Alessandro Cimatti, Andrea Micheli, Stefano Tonetta:
Generalizing Platform-Aware Mission Planning for Infinite-State Timed Transition Systems. - Alberto Pozanco, Marianela Morales, Daniel Borrajo, Manuela Veloso:
A Planning Compilation to Reason About Goal Achievement at Planning Time. - Andoni Rodríguez, Irfansha Shaik, Davide Corsi, Roy Fox, César Sánchez:
Explanations for Unrealizability of Infinite-State Safety Shields. - Mohammad Yousefi, Johannes Schmalz, Patrik Haslum, Pascal Bercher:
Probabilistic HTN Planning: Formalization and Computational Complexity Analysis. - Chenyuan Zhang, Cristian Rojas Cardenas, Hamid Rezatofighi, Mor Vered, Buser Say:
Probabilistic Active Goal Recognition.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-24 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
