Accepted Papers


Regular

  • The universal tangle for spatial reasoning — Konstantinos Papafilippou and David Fernández
  • Deterministic Weighted Automata under Partial Observability — Jakub Michaliszyn and Jan Otop
  • On Heuer’s Procedure for Verifying Strong Equivalence — Jorge Fandinno and Vladimir Lifschitz
  • Truth and Preferences - A Game Approach for Qualitative Choice Logic — Robert Freiman and Michael Bernreiter
  • Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation — Leopoldo Bertossi and Jorge Leon
  • Non-standard modalities in paraconsistent Gödel logic — Marta Bilkova, Sabine Frittella and Daniil Kozhemiachenko
  • Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets — Tim Lyon and Sebastian Rudolph
  • Hamiltonian Cycle Reconfiguration with Answer Set Programming — Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh and Naoyuki Tamura
  • Optimal Planning with Expressive Action Languages as Constraint Optimization — Enrico Giunchiglia and Armando Tacchella
  • Boosting Definability Bipartition Computation using SAT Witnesses — Jean Marie Lagniez and Pierre Marquis
  • Strongly complete axiomatization for a logic with probabilistic interventionist counterfactuals — Fausto Barbero and Jonni Virtema
  • A Principle-Based Analysis of Bipolar Argumentation Semantics — Liuwen Yu, Caren Al Anaissy, Srdjan Vesic, Xu Li and Leendert van der Torre
  • Deontic Equilibrium Logic with eXplicit negation — Pedro Cabalar, Agata Ciabattoni and Leon van der Torre
  • A New Class of Explanations for Classifiers with Non-Binary Features — Chunxi Ji and Adnan Darwiche
  • Reasoning in Assumption-based Argumentation using Tree-decompositions — Andrei Popescu and Johannes P. Wallner
  • Succinct Planning with Partial Observability by SAT — Saurabh Fadnis and Jussi Rintanen
  • First Steps Towards Taming Description Logics with Strings — Stéphane Demri and Karin Quaas
  • Splitting Techniques for Conditional Belief Bases in the Context of c-Representations — Marco Wilhelm, Meliha Sezgin, Gabriele Kern-Isberner, Jonas Philipp Haldimann, Christoph Beierle and Jesse Heyninck
  • Data Graphs with Incomplete Information (and a Way to Complete Them) — Carlos Areces, Valentin Cassano, Danae Dutto and Raul Fervari
  • How Easy it is to Know How: An Upper Bound for the Satisfiability Problem — Carlos Areces, Valentin Cassano, Pablo Castro, Raul Fervari and Andrés R. Saravia
  • Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies — Ahmed Laouar, Sihem Belabbes and Salem Benferhat
  • Deciding Subsumption in Defeasible ELI⊥ with Typicality Models — Igor de Camargo E Souza Câmara and Anni-Yasmin Turhan
  • Justified semantics for abstract argumentation — Sjur Kristoffer Dyrkolbotn
  • Robust Alternating-Time Temporal Logic — Aniello Murano, Daniel Neider and Martin Zimmermann
  • Short Boolean Formulas as Explanations in Practice — Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh and Miikka Vilander
  • Formalizing Statistical Causality via Modal Logic — Yusuke Kawamoto, Tetsuya Sato and Kohei Suenaga
  • Logics with probabilistic team semantics and the Boolean negation — Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier and Jonni Virtema
  • Belief Reconfiguration — Sébastien Konieczny, Elise Perrotin and Ramon Pino Perez
  • Contrastive Explanations for Answer-Set Programs — Thomas Eiter, Tobias Geibinger and Johannes Oetsch
  • DELPHIC: Practical DEL Planning via Possibilities — Alessandro Burigana, Paolo Felli and Marco Montali
  • Concept Combination in Weighted DL — Guendalina Righetti, Claudio Masolo and Pietro Galliani
  • Categorical Approximation Fixpoint Theory — Angelos Charalambidis and Panos Rondogiannis
  • Comparing Planning Domain Models using Answer Set Programming — Lukáš Chrpa, Carmine Dodaro, Marco Maratea, Marco Mochi and Mauro Vallati
  • On the Expressive Power of Assumption-Based Argumentation — Matti Berthold, Anna Rapberger and Markus Ulbricht
  • Towards systematic treatment of partial functions in Knowledge Representation — Djordje Markovic, Maurice Bruynooghe and Marc Denecker
  • Merge, Explain, Iterate: A Combination of MHS and MXP in an ABox Abduction Solver — Martin Homola, Júlia Pukancová, Janka Boborová and Iveta Balintová
  • Rational Closure Extension in SPO Representable Inductive Inference Operators — Jonas Philipp Haldimann, Thomas Meyer, Gabriele Kern-Isberner and Christoph Beierle
  • Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis — Sergei Obiedkov and Barış Sertkaya
  • Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features — Bartosz Bednarczyk
  • Hybrid Modal Operators for Definite Descriptions — Przemysław Andrzej Wałęga and Michal Zawidzki
  • Non-Normal Modal Description Logics — Tiziano Dalmonte, Andrea Mazzullo, Ana Ozaki and Nicolas Troquard

Short

  • Declarative Reasoning on Explanations Using Constraint Logic Programming — Laura State, Salvatore Ruggieri and Franco Turini
  • Base-based Model Checking for Multi-Agent Only Believing — Tiago de Lima, Emiliano Lorini and François Schwarzentruber
  • Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes — Mohammed El-Kholany, Ramsha Ali and Martin Gebser
  • Stable Normative Explanations: From Argumentation to Deontic Logic — Antonino Rotolo, Guido Governatori, Cecilia Di Florio and Giovanni Sartor
  • Algorithms for Inconsistency Measures Based on Minimal Unsatisfiability — Isabelle Kuhlmann, Andreas Niskanen and Matti Järvisalo
  • Plan Selection Framework for Policy-Aware Autonomous Agents — Charles Harders and Daniela Inclezan
  • recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming — Yuya Yamada, Mutsunori Banbara, Katsumi Inoue and Torsten Schaub
  • Past-present temporal logic programs over finite traces — Pedro Cabalar, Martín Diéguez, François Laferrière and Torsten Schaub
  • Enhancing Temporal Planning by Sequential Macro-actions — Marco De Bortoli, Lukáš Chrpa, Martin Gebser and Gerald Steinbauer-Wagner
  • Complexity and scalability of defeasible reasoning with typicality in many-valued weighted knowledge bases — Mario Alviano, Laura Giordano and Daniele Theseider Dupre
  • Logic, Accountability and Design — Pedro Cabalar and David Pearce