Invited Talks and Accepted Papers

Invited Talks

  • • Fabio Cozman , Knowledge-enhanced Machine Learning: How? Where?
  • • Lluis Godo, Boolean Algebras of Conditionals, Probability and Logic
  • • Francesca Toni, Dialectical explanations


  • • Leila Amgoud, Victor David and Dragan Doder , Similarity Measures between Arguments Revisited
  • • Rihab Bouslama, Raouia Ayachi and Nahla Ben Amor , A New Generic Framework for Mediated Multilateral Argumentation- based Negotiation using Case-Based Reasoning
  • • Jerome Delobelle and Serena Villata , Interpretability of Gradual Semantics in Abstract Argumentation
  • • Mariela Morveli Espinoza, Juan Carlos Nieves and Cesar Augusto Tacla , An Imprecise Probability Approach for Abstract Argumentation based on Credal Sets
  • • Anthony Hunter and Sylwia Polberg , A Model-based Theorem Prover for Epistemic Graphs for Argumentation
  • • Atefeh Keshavarzi Zafarghandi, Rineke Verbrugge and Bart Verheij , Discussion Games for Preferred Semantics of Abstract Dialectical Frameworks
  • • Nico Potyka, Sylwia Polberg and Anthony Hunter , Polynomial-time, Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation
  • • Chiaki Sakama and Katsumi Inoue , Ordering Argumentation Frameworks

Belief Functions

  • • Safa Ben Ayed, Zied Elouedi and Eric Lefevre, Toward the evaluation of Case Base Maintenance policies under the belief function theory
  • • Milan Daniel and Vaclav Kratochvil, Belief Functions and Degrees of Non-Conflictness
  • • Radim Jirousek and Vaclav Kratochvil, On Expected Utility under Ambiguity
  • • Serafin Moral-GarcIa, Joaquin Abellan and Maria Dolores Benitez, Combination in Dempster-Shafer theory based on a disagreement factor between evidences

Conditional, Default and Analogical Reasoning

  • • Nelly Barbot, Laurent Miclet, Henri Prade and Gilles Richard, A new perspective on analogical proportions
  • • Christoph Beierle and Steven Kutsch, On the Antecedent Normal Form of Conditional Knowledge Bases
  • • Nahla Benamor, Didier Dubois, Henri Prade and Syrine Saidi, Revisiting conditional preferences: from defaults to graphical representations
  • • Angelo Gilio and Giuseppe Sanfilippo, Conjunction of Conditional Events and T-norms
  • • Laura Giordano and Valentina Gliozzi, Reasoning about exceptions in ontologies: an approximation of the multipreference semantics
  • • Steven Kutsch and Christoph Beierle, Computation of Closures of Nonmonotonic Inference Relations Induced by Conditional Knowledge Bases
  • • Suryani Lim, Henri Prade and Gilles Richard, Solving word analogies: a machine learning perspective
  • • Kai Sauerwald and Christoph Beierle, Decrement Operators in Belief Change

Learning and Decision Making

  • • Peixian Chen, Zhourong Chen and Nevin L. Zhang, A Novel Document Generation Process for Topic Detection based on Hierarchical Latent Tree Models
  • • Zhourong Chen, Xiaopeng Li, Zhiliang Tian and Nevin L. Zhang, Fast Structure Learning for Deep Feedforward Networks via Tree Skeleton Expansion
  • • Ipek Kivanc and Demet Ozgur-Unluakin, An effective Maintenance Policy for a Multi-Component Dynamic System using Factored POMDPs
  • • Jonathan Lawry, Michael Crosscombe and David Harvey, Epistemic Sets Applied to Best-of- n Problems
  • • Philippe Leray and Mathilde Monvoisin, Multi-task Transfer Learning for Timescale Graphical Event Models
  • • Andrey Ruschel, Gustavo Padilha Poletti, Arthur Colombini Gusmao and Fabio Cozman, Explaining Answers from Knowledge Base Embeddings
  • • Thijs van Ommen, Wouter M. Koolen and Peter D. Grunwald, Efficient Algorithms for Minimax Decisions under Tree-Structured Incompleteness

Precise and Imprecise Probabilities

  • • Juan Carlos Alfaro Jimenez, Enrique Gonzalez Rodrigo, Juan Angel Aledo Sanchez and Jose Antonio Gamez Martin, A Probabilistic Graphical Model-based approach for the Label Ranking Problem
  • • Stefano Bonzio, Tommaso Flaminio and Paolo Galeazzi, Sure-wins under coherence: a geometrical perspective
  • • Andrey Bronevich and Igor Rozenberg, Conditioning of Imprecise Probabilities Based on Generalized Credal Sets
  • • Šejla Dautovic and Dragan Doder, Probabilistic logic for reasoning about actions in time
  • • Tommaso Flaminio, Towards a standard completeness for a probabilistic logic on infinite-valued events
  • • Hamzeh Mohammadi and Thomas Studer, Bayesian Confirmation and Justifications
  • • Niki Pfeifer and Giuseppe Sanfilippo, Probability propagation in selected Aristotelian syllogisms
  • • Jose M. Puerta, Jose A. Gamez, Juan A. Aledo and Jorge D. Laborda, Structural Fusion/Aggregation of Bayesian Networks via Greedy Equivalence Search Learning Algorithm
  • • Milan Studeny, Vaclav Kratochvil and Jirka Vomlel, On irreducible min-balanced set systems
  • • Natan T'Joens, Thomas Krak, Jasper De Bock and Gert De Cooman, A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains
  • • Remi Wieten, Floris Bex, Henry Prakken and Silja Renooij, Constructing Bayesian Network Graphs from Labeled Arguments

Uncertain Reasoning for Applications

  • • Bojan Marinkovićc, Paola Glavan, Zoran Ognjanović, Dragan Doder and Thomas Studer, Probabilistic Consensus of the Blockchain Protocol
  • • Jorge Castro, Joaquim Gabarro and Maria Serna, Measuring Investment Opportunities under Uncertainty
  • • Federico Toffano and Nic Wilson, Balancing Schedules Using Maximum Leximin