KR2021Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning

Full Papers

• Somebody Knows.

  1. Thomas Ågotnes
  2. Yì N. Wáng
  DetailsPDF
• Reasoning about Explanations for Non-validation in SHACL.

  1. Shqiponja Ahmetaj
  2. Robert David
  3. Magdalena Ortiz
  4. Axel Polleres
  5. Bojken Shehu
  6. Mantas Šimkus
  DetailsPDF
• Generalized Temporal Inference via Planning.

  1. Diego Aineto
  2. Sergio Jimenez
  3. Eva Onaindia
  DetailsPDF
• Equivalence of Semantics in Argumentation.

  1. Leila Amgoud
  2. Vivien Beuselinck
  DetailsPDF
• Synthesizing Best-effort Strategies under Multiple Environment Specifications.

  1. Benjamin Aminof
  2. Giuseppe De Giacomo
  3. Alessio Lomuscio
  4. Aniello Murano
  5. Sasha Rubin
  DetailsPDF
• Characterizations and Classifications of Argumentative Entailments.

  1. Ofer Arieli
  2. AnneMarie Borg
  3. Christian Straßer
  DetailsPDF
• On Free Description Logics with Definite Descriptions.

  1. Alessandro Artale
  2. Andrea Mazzullo
  3. Ana Ozaki
  4. Frank Wolter
  DetailsPDF
• On the Computational Intelligibility of Boolean Classifiers.

  1. Gilles Audemard
  2. Steve Bellart
  3. Louenas Bounia
  4. Frédéric Koriche
  5. Jean-Marie Lagniez
  6. Pierre Marquis
  DetailsPDF
• Admissibility in Probabilistic Argumentation.

  1. Christel Baier
  2. Martin Diller
  3. Clemens Dubslaff
  4. Sarah Alice Gaggl
  5. Holger Hermanns
  6. Nikolai Käfer
  DetailsPDF
• Correcting Hierarchical Plans by Action Deletion.

  1. Roman Barták
  2. Simona Ondrčková
  3. Gregor Behnke
  4. Pascal Bercher
  DetailsPDF
• Choices and their Consequences - Explaining Acceptable Sets in Abstract Argumentation Frameworks.

  1. Ringo Baumann
  2. Markus Ulbricht
  DetailsPDF
• DEL-based Epistemic Planning for Human-Robot Collaboration: Theory and Implementation.

  1. Thomas Bolander
  2. Lasse Dissing
  3. Nicolai Herrmann
  DetailsPDF
• Enforcing Sets of Formulas in Structured Argumentation.

  1. AnneMarie Borg
  2. Floris Bex
  DetailsPDF
• Capturing Homomorphism-Closed Decidable Queries with Existential Rules.

  1. Camille Bourgaux
  2. David Carral
  3. Markus Krötzsch
  4. Sebastian Rudolph
  5. Michaël Thomazo
  DetailsPDF
• On the Identifiability of Hierarchical Decision Models.

  1. Roman Bresson
  2. Johanne Cohen
  3. Eyke Hüllermeier
  4. Christophe Labreuche
  5. Michèle Sebag
  DetailsPDF
• Parallelisable Existential Rules: a Story of Pieces.

  1. Maxime Buron
  2. Marie-Laure Mugnier
  3. Michaël Thomazo
  DetailsPDF
• Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security.

  1. Claudia Cauli
  2. Magdalena Ortiz
  3. Nir Piterman
  DetailsPDF
• On Eventual Applicability of Plans in Dynamic Environments with Cyclic Phenomena.

  1. Lukáš Chrpa
  2. Martin Pilát
  3. Jakub Med
  DetailsPDF
• An Account of Intensional and Extensional Actions, and its Application to Belief, Nondeterministic Actions and Fallible Sensors.

  1. Jens Claßen
  2. James P. Delgrande
  DetailsPDF
• A Compilation of Succinctness Results for Arithmetic Circuits.

  1. Alexis de Colnet
  2. Stefan Mengel
  DetailsPDF
• The Nondeterministic Situation Calculus.

  1. Giuseppe De Giacomo
  2. Yves Lespérance
  DetailsPDF
• Timed Trace Alignment with Metric Temporal Logic over Finite Traces.

  1. Giuseppe De Giacomo
  2. Aniello Murano
  3. Fabio Patrizi
  4. Giuseppe Perelli
  DetailsPDF
• Synthesis with Mandatory Stop Actions.

  1. Giuseppe De Giacomo
  2. Antonio Di Stasio
  3. Giuseppe Perelli
  4. Shufang Zhu
  DetailsPDF
• Beyond Simple Images: Human Knowledge-Guided GANs for Clinical Data Generation.

  1. Devendra Singh Dhami
  2. Mayukh Das
  3. Sriraam Natarajan
  DetailsPDF
• Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches.

  1. Dominik Drexler
  2. Jendrik Seipp
  3. Hector Geffner
  DetailsPDF
• Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting.

  1. Thomas Eiter
  2. Markus Hecher
  3. Rafael Kiesel
  DetailsPDF
• Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling.

  1. Thomas Eiter
  2. Tobias Geibinger
  3. Nysret Musliu
  4. Johannes Oetsch
  5. Peter Skočovský
  6. Daria Stepanova
  DetailsPDF
• Borda, Cancellation and Belief Merging.

  1. Patricia Everaere
  2. Chouaib Fellah
  3. Sébastien Konieczny
  4. Ramón Pino Pérez
  DetailsPDF
• Reasoning over Attack-incomplete AAFs in the Presence of Correlations.

  1. Bettina Fazzinga
  2. Sergio Flesca
  3. Filippo Furfaro
  DetailsPDF
• Rational Verification for Probabilistic Systems.

  1. Julian Gutierrez
  2. Lewis Hammond
  3. Anthony W. Lin
  4. Muhammad Najib
  5. Michael Wooldridge
  DetailsPDF
• How to Approximate Ontology-Mediated Queries.

  1. Anneke Haga
  2. Carsten Lutz
  3. Leif Sabellek
  4. Frank Wolter
  DetailsPDF
• Approximation Fixpoint Theory for Non-Deterministic Operators and Its Application in Disjunctive Logic Programming.

  1. Jesse Heyninck
  2. Ofer Arieli
  DetailsPDF
• Revision and Conditional Inference for Abstract Dialectical Frameworks.

  1. Jesse Heyninck
  2. Gabriele Kern-Isberner
  3. Tjitze Rienstra
  4. Kenneth Skiba
  5. Matthias Thimm
  DetailsPDF
• On Efficiently Explaining Graph-Based Classifiers.

  1. Xuanxiang Huang
  2. Yacine Izza
  3. Alexey Ignatiev
  4. Joao Marques-Silva
  DetailsPDF
• Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them.

  1. Wojciech Jamroga
  2. Wojciech Penczek
  3. Teofil Sidoruk
  DetailsPDF
• Safe Learning of Lifted Action Models.

  1. Brendan Juba
  2. Hai S. Le
  3. Roni Stern
  DetailsPDF
• Separating Data Examples by Description Logic Concepts with Restricted Signatures.

  1. Jean Christoph Jung
  2. Carsten Lutz
  3. Hadrien Pulcini
  4. Frank Wolter
  DetailsPDF
• Satisfiability Checking of Strategy Logic with Simple Goals.

  1. Magdalena Kacprzak
  2. Artur Niewiadomski
  3. Wojciech Penczek
  DetailsPDF
• Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic.

  1. Yusuke Kawamoto
  2. Tetsuya Sato
  3. Kohei Suenaga
  DetailsPDF
• Semi-Stable Semantics for Abstract Dialectical Frameworks.

  1. Atefeh Keshavarzi Zafarghandi
  2. Rineke Verbrugge
  3. Bart Verheij
  DetailsPDF
• Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases.

  1. Spencer Killen
  2. Jia-Huai You
  DetailsPDF
• Diagnosis of Active Systems with Abstract Observations and Compiled Knowledge.

  1. Gianfranco Lamperti
  2. Marina Zanella
  3. Xiangfu Zhao
  DetailsPDF
• Unsupervised Novelty Characterization in Physical Environments Using Qualitative Spatial Relations.

  1. Ruiqi Li
  2. Hua Hua
  3. Patrik Haslum
  4. Jochen Renz
  DetailsPDF
• On the Progression of Belief.

  1. Daxin Liu
  2. Qihui Feng
  DetailsPDF
• Approximate Inference for Neural Probabilistic Logic Programming.

  1. Robin Manhaeve
  2. Giuseppe Marra
  3. Luc De Raedt
  DetailsPDF
• Strategic Reasoning in Automated Mechanism Design.

  1. Bastien Maubert
  2. Munyque Mittelmann
  3. Aniello Murano
  4. Laurent Perrussel
  DetailsPDF
• Properties of Module Notions and Atomic Decomposition.

  1. Robin Nolte
  2. Thomas Schneider
  DetailsPDF
• Monotonicity and Noise-Tolerance in Case-Based Reasoning with Abstract Argumentation.

  1. Guilherme Paulino-Passos
  2. Francesca Toni
  DetailsPDF
• Representing and Reasoning with Event Models for Epistemic Planning.

  1. David Rajaratnam
  2. Michael Thielscher
  DetailsPDF
• Consolidation via Tacit Culpability Measures: Between Explicit and Implicit Degrees of Culpability.

  1. Jandson S. Ribeiro
  2. Matthias Thimm
  DetailsPDF
• Learning First-Order Representations for Planning from Black Box States: New Results.

  1. Ivan D. Rodriguez
  2. Blai Bonet
  3. Javier Romero
  4. Hector Geffner
  DetailsPDF
• Existential Abstraction on Argumentation Frameworks via Clustering.

  1. Zeynep G. Saribatur
  2. Johannes P. Wallner
  DetailsPDF
• Boolean Network Learning in Vector Spaces for Genome-wide Network Analysis.

  1. Taisuke Sato
  2. Ryosuke Kojima
  DetailsPDF
• Decidability and Complexity of Some Finitely-valued Dynamic Logics.

  1. Igor Sedlár
  DetailsPDF
• Gaussian Elimination Meets Maximum Satisfiability.

  1. Mate Soos
  2. Kuldeep S. Meel
  DetailsPDF
• Belief Contraction in Non-classical logics as Hyperintensional Belief Change.

  1. Marlo Souza
  2. Renata Wassermann
  DetailsPDF
• Lifted Inference with Tree Axioms.

  1. Timothy van Bremen
  2. Ondřej Kuželka
  DetailsPDF
• DatalogMTL with Negation Under Stable Models Semantics.

  1. Przemysław A. Wałęga
  2. David J. Tena Cucala
  3. Egor V. Kostylev
  4. Bernardo Cuenca Grau
  DetailsPDF
• Finitely Materialisable Datalog Programs with Metric Temporal Operators.

  1. Przemysław A. Wałęga
  2. Michał Zawidzki
  3. Bernardo Cuenca Grau
  DetailsPDF
• A Principle-based Analysis of Abstract Agent Argumentation Semantics.

  1. Liuwen Yu
  2. Dongheng Chen
  3. Lisha Qiao
  4. Yiqi Shen
  5. Leendert van der Torre
  DetailsPDF

Short Papers

• Making DL-Lite Planning Practical.

  1. Stefan Borgwardt
  2. Jörg Hoffmann
  3. Alisa Kovtunova
  4. Marcel Steinmetz
  DetailsPDF
• A Many-valued Logic for Lexicographic Preference Representation.

  1. Angelos Charalambidis
  2. George Papadimitriou
  3. Panos Rondogiannis
  4. Antonis Troumpoukis
  DetailsPDF
• Universal and Uniform Action Reversibility.

  1. Lukáš Chrpa
  2. Wolfgang Faber
  3. Michael Morak
  DetailsPDF
• Measuring Inconsistency over Sequences of Business Rule Cases.

  1. Carl Corea
  2. Matthias Thimm
  3. Patrick Delfmann
  DetailsPDF
• Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo.

  1. Fabio Aurelio D'Asaro
  2. Paolo Baldi
  3. Giuseppe Primiero
  DetailsPDF
• Combining Logic and Natural Language Processing to Support Investment Management.

  1. Marjolein Deryck
  2. Nuno Comenda
  3. Bart Coppens
  4. Joost Vennekens
  DetailsPDF
• On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length.

  1. Wolfgang Dvořák
  2. Matthias König
  3. Stefan Woltran
  DetailsPDF
• A Dynamic Epistemic Logic with Finite Iteration and Parallel Composition.

  1. Andreas Herzig
  2. Frédéric Maris
  3. Elise Perrotin
  DetailsPDF
• On the Epistemic Logic of Incomplete Argumentation Frameworks.

  1. Andreas Herzig
  2. Antonio Yuste-Ginel
  DetailsPDF
• Distinguishability in Abstract Argumentation.

  1. Isabelle Kuhlmann
  2. Tjitze Rienstra
  3. Lars Bengel
  4. Kenneth Skiba
  5. Matthias Thimm
  DetailsPDF
• Sticky Existential Rules and Disjunction are Incompatible.

  1. Michael Morak
  DetailsPDF
• Randomized Problem-Relaxation Solving for Over-Constrained Schedules.

  1. Patrick Rodler
  2. Erich Teppan
  3. Dietmar Jannach
  DetailsPDF
• Flexible Robotic Assembly Based on Ontological Representation of Tasks, Skills, and Resources.

  1. Philipp Matthias Schäfer
  2. Franz Steinmetz
  3. Stefan Schneyer
  4. Timo Bachmann
  5. Thomas Eiband
  6. Florian Samuel Lay
  7. Abhishek Padalkar
  8. Christoph Sürig
  9. Freek Stulp
  10. Korbinian Nottensteiner
  DetailsPDF
• On the Maximal Number of Complete Extensions in Abstract Argumentation Frameworks.

  1. Markus Ulbricht
  DetailsPDF
• PATCHCOMM: Using Commonsense Knowledge to Guide Syntactic Parsers.

  1. Yida Xin
  2. Henry Lieberman
  3. Peter Chin
  DetailsPDF