default search action
17th KR 2020: Rhodes, Greece
- Diego Calvanese, Esra Erdem, Michael Thielscher:
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020. 2020, ISBN 978-0-9992411-7-2
Main Track
- Heba Aamer
, Bart Bogaerts
Inputs, Outputs, and Composition in the Logic of Information Flows. 2-11 - Erman Acar, Rafael Peñaloza:
Reasoning with Contextual Knowledge and Influence Diagrams. 12-21 - Michael E. Akintunde, Elena Botoeva, Panagiotis Kouvaros, Alessio Lomuscio:
Verifying Strategic Abilities of Neural-symbolic Multi-agent Systems. 22-32 - Gianvincenzo Alfano
Explainable Acceptance in Probabilistic Abstract Argumentation: Complexity and Approximation. 33-43 - Mario Alviano:
Answer Set Programming with Composed Predicate Names. 44-48 - Alexsander Andrade de Melo
Symbolic Solutions for Symbolic Constraint Satisfaction Problems. 49-58 - Yaniv Aspis, Krysia Broda, Alessandra Russo, Jorge Lobo:
Stable and Supported Semantics in Continuous Vector Spaces. 59-68 - Marcello Balduccini, Michael Gelfond
An Answer Set Programming Framework for Reasoning about Agents' Beliefs and Truthfulness of Statements. 69-78 - Ringo Baumann, Gerhard Brewka, Markus Ulbricht
Comparing Weak Admissibility Semantics to their Dung-style Counterparts - Reduct, Modularization, and Strong Equivalence in Abstract Argumentation. 79-88 - Francesco Belardinelli
A Three-valued Approach to Strategic Abilities under Imperfect Information. 89-98 - Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi:
Ordinal Polymatrix Games with Incomplete Information. 99-108 - Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura:
Balancing Expressiveness and Inexpressiveness in View Design. 109-118 - Sara Bernardini, Fabio Fagnani, Santiago Franco:
An Optimization Approach to Robust Goal Obfuscation. 119-129 - Nicola Bertoglio, Gianfranco Lamperti, Marina Zanella, Xiangfu Zhao:
Explanatory Diagnosis of Discrete-Event Systems with Temporal Information and Smart Knowledge-Compilation. 130-140 - Meghyn Bienvenu
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation. 141-151 - Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Fabio Patrizi
High-level Programming via Generalized Planning and LTL Synthesis. 152-161 - Laura Bozzelli, Aniello Murano
Module Checking of Pushdown Multi-agent Systems. 162-171 - David Buckingham, Daniel Kasenberg, Matthias Scheutz
Simultaneous Representation of Knowledge and Belief for Epistemic Planning with Belief Revision. 172-181 - Pedro Cabalar, Paulo E. Santos
Spatial Reasoning about String Loops and Holes in Temporal ASP. 182-192 - Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. 193-202 - Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Preference-based Inconsistency-Tolerant Query Answering under Existential Rules. 203-212 - Giovanni Casini
Rational Defeasible Belief Change. 213-222 - Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andrius Vaicenavicius:
Explanations for Negative Query Answers under Existential Rules. 223-232 - Jake Chandler
Revision by Conditionals: From Hook to Arrow. 233-242 - Gianluca Cima
Non-Monotonic Ontology-based Abstractions of Data Services. 243-252 - Jens Claßen, James P. Delgrande:
Dyadic Obligations over Complex Actions as Deontic Constraints in the Situation Calculus. 253-263 - Marco Console, Matthias F. J. Hofer, Leonid Libkin:
Reasoning about Measures of Unmeasurable Sets. 264-273 - Martin C. Cooper, Andreas Herzig, Frédéric Maris, Elise Perrotin, Julien Vianey:
Lightweight Parallel Multi-Agent Epistemic Planning. 274-283 - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak
Fine-Grained Complexity of Temporal Problems. 284-293 - Giuseppe De Giacomo, Bastien Maubert, Aniello Murano
Nondeterministic Strategies and their Refinement in Strategy Logic. 294-303 - Giuseppe De Giacomo, Antonio Di Stasio
Two-Stage Technique for LTLf Synthesis Under LTL Assumptions. 304-314 - Massimiliano de Leoni, Paolo Felli, Marco Montali:
Strategy Synthesis for Data-Aware Dynamic Systems with Multiple Actors. 315-325 - James P. Delgrande:
A Preference-Based Approach to Defeasible Deontic Inference. 326-335 - Florence Dupin de Saint-Cyr, Henri Prade:
Jokes and Belief Revision. 336-340 - Wolfgang Dvorák, Anna Rapberger
Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. 341-350 - Thorsten Engesser, Robert Mattmüller, Bernhard Nebel
Token-based Execution Semantics for Multi-Agent Epistemic Planning. 351-360 - Renyan Feng, Erman Acar, Stefan Schlobach
On Sufficient and Necessary Conditions in Bounded CTL: A Forgetting Approach. 361-370 - Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Conjunctive Regular Path Queries. 371-380 - Diego Figueira, Santiago Figueira, Edwin Pin Baque:
Finite Controllability for Ontology-Mediated Query Answering of CRPQ. 381-391 - Robert Ganian, Tomás Peitl, Friedrich Slivovsky
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. 392-402 - Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii
A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom. 403-413 - Fausto Giunchiglia, Mattia Fumagalli:
Entity Type Recognition - Dealing with the Diversity of Knowledge. 414-423 - Tomasz Gogacz, Víctor Gutiérrez-Basulto, Albert Gutowski
On Finite Entailment of Non-Local Queries in Description Logics. 424-433 - Tomasz Gogacz, Sanja Lukumbuzya, Magdalena Ortiz, Mantas Simkus
Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates. 434-444 - Georg Gottlob, Marco Manna, Andreas Pieris:
Multi-head Guarded Existential Rules Over Fixed Signatures. 445-454 - Davide Grossi
Logics of Preference when There Is No Best. 455-464 - Jonas Philipp Haldimann, Gabriele Kern-Isberner, Christoph Beierle:
Syntax Splitting for Iterated Contractions. 465-475 - Joseph Y. Halpern, Evan Piermont:
Dynamic Awareness. 476-484 - Markus Hecher:
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? 485-495 - Anthony Hunter
Reasoning with Inconsistent Knowledge using the Epistemic Approach to Probabilistic Argumentation. 496-505 - Yazmín Ibáñez-García, Víctor Gutiérrez-Basulto, Steven Schockaert:
Plausible Reasoning about EL-Ontologies using Concept Interpolation. 506-516 - Jean Christoph Jung
Logical Separability of Incomplete Data under Ontologies. 517-528 - Jean Christoph Jung
On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions. 529-538 - Magdalena Kacprzak
SAT-Based ATL Satisfiability Checking. 539-549 - Sarah Keren, Sara Bernardini, Kofi Kwapong, David C. Parkes:
Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents. 550-559 - Gabriele Kern-Isberner, Christoph Beierle, Gerhard Brewka:
Syntax Splitting = Relevance + Independence: New Postulates for Nonmonotonic Reasoning From Conditional Belief Bases. 560-571 - Toryn Q. Klassen, Sheila A. McIlraith, Hector J. Levesque:
Changing Beliefs about Domain Dynamics in the Situation Calculus. 572-581 - Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev:
Boolean Role Inclusions in DL-Lite With and Without Time. 582-591 - Patrick Koopmann, Warren Del-Pinto, Sophie Tourret, Renate A. Schmidt:
Signature-Based Abduction for Expressive Description Logics. 592-602 - Markus Krötzsch:
Computing Cores for Existential Rules with the Standard Chase and ASP. 603-613 - Nadia Labai, Magdalena Ortiz, Mantas Simkus
An ExpTime Upper Bound for ALC with Integers. 614-623 - Gerhard Lakemeyer, Hector J. Levesque:
A First-Order Logic of Limited Belief Based on Possible Worlds. 624-635 - Tuomo Lehtonen
An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework. 636-646 - Jean-Guy Mailly, Julien Rossit:
Argument, I Choose You! Preferences and Ranking Semantics in Abstract Argumentation. 647-651 - Michael Morak, Lukás Chrpa, Wolfgang Faber, Daniel Fiser
On the Reversibility of Actions in Planning. 652-661 - Van Nguyen, Vasileiou Loukas Stylianos, Tran Cao Son, William Yeoh:
Explainable Planning Using Answer Set Programming. 662-666 - Andreas Niskanen
Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation. 667-671 - Rafael Peñaloza:
Towards a Logic of Meta-Analysis. 672-676 - Nico Potyka:
Bipolar Abstract Argumentation with Dual Attacks and Supports. 677-686 - Fillipe Resina, Marco Garapa
Choosing What to Believe - New Results in Selective Revision. 687-691 - Simon Rey, Ulle Endriss
Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. 692-702 - Adam Richard-Bollans
Modelling the Polysemy of Spatial Prepositions in Referring Expressions. 703-712 - Tjitze Rienstra, Matthias Thimm, Kristian Kersting, Xiaoting Shao:
Independence and D-separation in Abstract Argumentation. 713-722 - Tjitze Rienstra, Claudia Schon, Steffen Staab:
Concept Contraction in the Description Logic EL. 723-732 - Zeynep G. Saribatur, Thomas Eiter:
A Semantic Perspective on Omission Abstraction in ASP. 733-737 - Nicolas Schwind, Sébastien Konieczny:
Non-Prioritized Iterated Revision: Improvement via Incremental Belief Merging. 738-747 - Michael Stewart
Seq2KG: An End-to-End Neural Model for Domain Agnostic Knowledge Graph (not Text Graph) Construction from Text. 748-757 - Etienne Toussaint, Paolo Guagliardo, Leonid Libkin:
Knowledge-Preserving Certain Answers for SQL-like Queries. 758-767 - Przemyslaw Andrzej Walega, Bernardo Cuenca Grau, Mark Kaminski, Egor V. Kostylev
DatalogMTL over the Integer Timeline. 768-777
Applications and Systems
- Christoph Benzmüller
A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument. 779-789 - Nikos Katzouris, Alexander Artikis:
WOLED: A tool for Online Learning Weighted Answer Set Rules for Temporal Reasoning Under Uncertainty. 790-799 - Andreas Niskanen
µ-toksia: An Efficient Abstract Argumentation Reasoner. 800-804 - Antonio Rago, Oana Cocarascu, Christos Bechlivanidis, Francesca Toni:
Argumentation as a Framework for Interactive Explanations for Recommendations. 805-815 - Zhiwei Zeng
Explainable and Argumentation-based Decision Making with Qualitative Preferences for Diagnostics and Prognostics of Alzheimer's Disease. 816-826
Special Session on KR and Machine Learning
- Ralph Abboud, Ismail Ilkan Ceylan, Radoslav Dimitrov:
On the Approximability of Weighted Model Integration on DNF Structures. 828-837 - Gilles Audemard, Frédéric Koriche, Pierre Marquis:
On Tractable XAI Queries based on Compiled Representations. 838-849 - Jiaoyan Chen, Freddy Lécué, Yuxia Geng, Jeff Z. Pan, Huajun Chen:
Ontology-guided Semantic Composition for Zero-shot Learning. 850-854 - Fabio Aurelio D'Asaro
Towards an Inductive Logic Programming Approach for Explaining Black-Box Preference Learning Systems. 855-859 - Giuseppe De Giacomo, Marco Favorito
Temporal Logic Monitoring Rewards via Transducers. 860-870 - Régis Riveret, Son N. Tran, Artur S. d'Avila Garcez:
Neuro-Symbolic Probabilistic Argumentation Machines. 871-881 - Weijia Shi, Andy Shih, Adnan Darwiche, Arthur Choi:
On Tractable Representations of Binary Neural Networks. 882-892 - Emile van Krieken
Analyzing Differentiable Fuzzy Implications. 893-903
Special Session on KR and Robotics
- Agnese Chiatti, Enrico Motta
Towards a Framework for Visual Intelligence in Service Robotics: Epistemic Requirements and Gap Analysis. 905-916 - Alessandro Umbrico, Gabriella Cortellessa, Andrea Orlandini, Amedeo Cesta:
Modeling Affordances and Functioning for Personalized Robotic Assistance. 917-926
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 2024-12-17 20:47 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: