Program

Conference Program at a Glance

:: day 1 :: day 2 :: day 3 :: day 4 :: day 5 ::

Monday – Day 1 (July 10)
08:00 – 08:50 Registration
08:50 – 09:00 Opening (ISIPTA)
09:00 – 10:20 Session “Foundations 1” (4 talks)
10:20 – 10:40 Coffee break
10:40 – 11:20 Session “Foundations 2” (2 talks)
11:20 – 11:30 Break
11:30 – 12:30 Keynote 1 (Benavoli)
12:30 – 14:00 Lunch
14:00 – 15:20 Session “Teddy Seidenfeld” (4 talks)
15:20 – 15:40 Coffee break
15:40 – 17:00 Session “Decision Making” (4 talks)
17:00 – 17:20 Break
17:20 – 18:20 Poster Session #1 (3 spotlight talks + 10 posters)
19:00 – 20:30 Welcome reception

to top

Tuesday – Day 2 (July 11)
08:50 – 09:00 Opening (ECSQARU)
09:00 – 10:20 Session “Learning 1” (4 talks)
10:20 – 10:40 Coffee break
10:40 – 11:20 Session “Learning 2” (2 talks)
11:20 – 11:30 Break
11:30 – 12:30 Keynote 2 (Hüllemeier)
12:30 – 14:10 Conference lunch
14:10 – 15:30 Session “Graphical Models 1” (4 talks)
15:30 – 15:50 Coffee break
15:50 – 16:50 Session “Graphical Models 2” (3 talks)
16:50 – 17:10 Break
17:10 – 18:30 Session “Graphical Models 3” (4 talks)

to top

Wednesday – Day 3 (July 12)
09:00 – 10:20 Sessions “Belief Functions 1” + “Elicitation” (4+4 talks)
10:20 – 10:40 Coffee break
10:40 – 11:20 Sessions “Belief Functions 2” + “Analogical Reasoning” (2+2 talks)
11:20 – 11:30 Break
11:30 – 12:30 Keynote 3 (Berger)
12:30 – 14:00 Lunch
14:00 – 15:00 Keynote 4 (Amgoud)
15:00 – 15:20 Coffee break
15:20 – 16:40 Sessions “Coherence” + “Argumentation” (4+4 talks)
16:40 – 17:00 Break
17:00 – 18:20 Sessions “Credal Sets” + “Game Theory” (4+4 talks)

to top

Thursday – Day 4 (July 13)
09:00 – 10:20 Session “Conditionals” (4 talks)
10:20 – 10:40 Coffee break
10:40 – 11:20 Session “Logics” (2 talks)
11:20 – 11:30 Break
11:30 – 12:30 Keynote 5 (Dubois)
12:30 – 14:10 Conference Lunch
14:10 – 15:30 Session “Probabilistic Logics” (4 talks)
15:30 – 15:50 Coffee break
15:50 – 16:50 Session “Probabilistic Programming” (3 talks)
16:50 – 17:10 Break
17:10 – 18:30 Session “Fuzzy” (4 talks)
18:30 – 19:30 SIPTA & ECSQARU general meetings

to top

Friday – Day 5 (July 14)
09:00 – 10:00 Poster Session #2 (5 spotlight talks + 9 posters)
10:00 – 10:20 Coffee break
10:20 – 11:20 Round Table: Open Problems in Imprecise Probability Theory
11:20 – 11:30 Break
11:30 – 12:30 Poster Session #3 (6 spotlight talks + 9 posters)
12:30 – 12:40 Closing

to top

Session “Foundations 1” (Monday morning)

Chair: Marco Zaffalon.

  • Thomas Augustin and Rudolf Seising. Kurt Weichselberger’s Contribution to Imprecise Probabilities.
  • Gert de Cooman and Jasper De Bock. Computable randomness is inherently imprecise.
  • Marco Cattaneo. Empirical interpretation of imprecise probabilities.
  • Alessio Benavoli, Alessandro Facchini, Dario Piga and Marco Zaffalon. SOS for bounded rationality.

to top

Session “Foundations 2” (Monday morning)

Chair: Matthias Troffaes

  • Alessio Benavoli, Alessandro Facchini, José Vicente-Pérez and Marco Zaffalon.
    A polarity theory for sets of desirable gambles.
  • Milan Studeny and Vaclav Kratochvil. Linear core-based criterion for testing extreme exact games.

to top

Session “Teddy Seidenfeld” (Monday afternoon)

Chair: Fabio Cozman.

  • Fabio Cozman. Evenly convex credal sets.
  • Jiji Zhang, Hailin Liu and Teddy Seidenfeld. Agreeing to disagree and dilation.
  • Thijs van Ommen. Computing minimax decisions with incomplete observations.
  • Arthur Van Camp and Gert De Cooman. Exchangeable choice functions.

to top

Session “Decision Making” (Monday afternoon)

Chair: Sébastien Destercke.

  • Inés Couso, Antonio Ávarez-Caballero and Luciano Sánchez. Reconciling Bayesian and frequentist tests: the imprecise counterpart.
  • Matthias Troffaes and Ullrika Sahlin. Imprecise swing weighting for multi-attribute utility elicitation based on partial preferences.
  • Christoph Jansen, Georg Schollmeyer and Thomas Augustin. Concepts for decision making under severe uncertainty with partial ordinal and partial cardinal preferences.
  • Thiago Bueno, Denis Mauá, Leliane Barros and Fabio Cozman. Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming.

to top

Session “Learning 1” (Tuesday morning)

Chair: Inés Couso.

  • Anders Madsen, Nicolaj Søndberg-Jeppesen, Frank Jensen, Mohamed Sayed, Ulrich Moser, Luis Neto, Joao Reis and Niels Lohse. Parameter learning algorithms for continuous model improvement using operational data.
  • Maroua Haddad, Philippe Leray and Nahla Ben Amor. Possibilistic MDL: a new possibilistic likelihood based score function for imprecise data.
  • Julia Plass, Aziz Omar and Thomas Augustin. Towards a cautious modelling of missing data in small area estimation.
  • Romain Guillaume, Inés Couso and Didier Dubois. Maximum likelihood with coarse data based on robust optimisation.

to top

Session “Learning 2” (Tuesday morning)

Chair: Alessio Benavoli.

  • Paul Fink and Thomas Augustin. (Generalized) linear regression on microaggregated data – from nuisance parameter optimization to partial identification.
  • Asma Trabelsi, Zied Elouedi and Eric Lefevre. Ensemble enhanced evidential k-NN classifier through random subspaces.

to top

Session “Graphical Models” (Tuesday afternoon)

Chair: Jasper De Bock.

  • Linda C. van der Gaag and Stavros Lopatatzidis. Exploiting stability for compact representations of independency models.
  • Janneke Bolt and Silja Renooij. Structure-based categorisation of Bayesian network parameters.
  • Fabio Cozman and Denis Mauà. The descriptive complexity of Bayesian network specifications.
  • Nahla Ben Amor, Zeineb Elkhalfi, Hélène Fargier and Régis Sabbadin. Efficient policies for stationary possibilistic Markov decision processes.

to top

Session “Graphical Models 2” (Tuesday afternoon)

Chair: Alessandro Antonucci.

  • Denis Mauà, Fabio Cozman, Diarmaid Conaty and Cassio De Campos. Credal sum-product networks.
  • Thomas Krak, Jasper De Bock and Arno Siebes. Efficient computation of updated lower expectations for imprecise continuous-time hidden Markov chains.
  • Alexander Erreygers and Jasper De Bock. Imprecise Continuous-time Markov chains: efficient computational methods with guaranteed error bounds.

to top

Session “Graphical Models 3” (Tuesday afternoon)

Chair: Giorgio Corani.

  • Martin Plajner and Jirka Vomlel. Monotonicity in Bayesian networks for computerized adaptive testing.
  • Francesca Mangili, Claudio Bonesana and Alessandro Antonucci. Reliable knowledge-based adaptive testing by credal networks.
  • Nahla Ben Amor, Fatma Essghaier and Hélène Fargier. Algorithms for multi-criteria optimization in possibilistic decision trees.
  • Jirka Vomlel and Václav Kratochvíl. Solving trajectory optimization problems by influence diagrams.

to top

Session “Belief Functions 1” (Wednesday morning)

Chair: Barbara Vantaggi.

  • Lalintha G. Polpitiya, Kamal Premaratne, Manohar N. Murthi and Dilip Sarkar. Efficient computation of belief theoretic conditionals.
  • Lina Abassi and Imen Boukhris. Iterative aggregation of crowdsourced tasks within the belief function theory.
  • Raoua Abdelkhalek, Imen Boukhris and Zied Elouedi. A clustering approach for collaborative filtering under the belief function framework.
  • Nathalie Helal, Frédéric Pichon, Daniel Porumbel, David Mercier and Eric Lefèvre. A Recourse approach for the capacitated vehicle routing problem with evidential demands.

to top

Session “Belief Functions 2” (Wednesday morning)

Chair: Frédéric Pichon.

  • Sébastien Destercke. A generic framework to include belief functions in preference handling and multi-criteria decision.
  • Sabrine Mallek, Imen Boukhris, Zied Elouedi and Eric Lefevre. Evidential k-NN for link prediction.

to top

Session “Elicitation” (Wednesday morning)

Chair: Silja Renooji.

  • Ahmed Samet, Thomas Guyet, Benjamin Negrevergne, Tien Tuan Dao, Tuan Nha Hoang and Marie Christine Ho Ba Tho. Expert opinion extraction from a biomedical database.
  • Dionissi Aliprantis. Differences of opinion.
  • Erik Quaeghebeur, Chris Wesseling, Emma Beauxis-Aussalet, Teresa Piovesan and Tom Sterkenburg. The CWI world cup competition: eliciting sets of acceptable gambles.
  • Michael Smithson. New distributions for modeling subjective lower and upper probabilities.

to top

Session “Analogical Reasoning” (Wednesday morning)

Chair: Anthony Hunter.

  • Henri Prade and Gilles Richard. Analogical inequalities.
  • Henri Prade and Gilles Richard. Boolean analogical proportions – axiomatics and algorithmic complexity issues.

to top

Session “Coherence” (Wednesday afternoon)

Chair: Enrique Miranda.

  • Nawapon Nakharutai, Matthias Troffaes and Camila Caiado. Efficient algorithms for checking avoiding sure loss.
  • Giulianella Coletti, Davide Petturiti and Barbara Vantaggi. Bayesian inference under ambiguity: conditional prior belief functions.
  • Jasper De Bock. Independent natural extension for infinite spaces: Williams-coherence to the rescue.
  • Chiara Corsato, Renato Pelessoni and Paolo Vicig. Weak Dutch Books versus strict consistency with lower previsions.

to top

Session “Credal Sets” (Wednesday afternoon)

Chair: Erik Quaeghebeur.

  • Ignacio Montes, Enrique Miranda and Sébastien Destercke. A study of the pari-mutuel model from the point of view of imprecise probabilities.
  • Damjan Skulj. Errors bounds for finite approximations of coherent lower previsions.
  • Matthias Troffaes. A note on imprecise Monte Carlo over credal sets via importance sampling.
  • Andrey Bronevich and Igor Rozenberg. Incoherence correction and decision making based on generalized credal sets.

to top

Session “Argumentation” (Wednesday afternoon)

Chair: Didier Dubois.

  • Anthony Hunter and Nico Potyka. Updating Probabilistic epistemic states in persuasion dialogues.
  • Tuomo Lehtonen, Johannes P. Wallner and Matti Järvisalo. From structured to abstract argumentation: assumption-based acceptance via AF reasoning.
  • Henry Prakken. On relating abstract and structured probabilistic argumentation: a case study.
  • Leila Amgoud and Jonathan Ben-Naim. Evaluation of arguments in weighted bipolar graphs.

to top

Session “Game Theory” (Wednesday afternoon)

Chair: Milan Studeny.

  • Nadira Boudjani, Abdelkader Gouaich and Souhila Kaci. Debate-based learning game for constructing mathematical proofs.
  • Mustapha Ridaoui, Michel Grabisch and Christophe Labreuche. Axiomatization of an importance index for k-ary games.
  • Giulia Fragnito, Joaquim Gabarro and Maria Serna. An Angel-daemon approach to assess the uncertainty in the power of a collectivity to act.
  • Enrique Miranda and Ignacio Montes. Game solutions, probability transformations and the core.

to top

Session “Conditionals” (Thursday morning)

Chair: Henri Prade.

  • Christoph Beierle and Steven Kutsch. Comparison of inference relations defined over different sets of ranking functions.
  • Marco Wilhelm, Christian Eichhorn, Richard Niland and Gabriele Kern-Isberner. A semantics for conditionals with default negation.
  • Christoph Beierle, Christian Eichhorn and Gabriele Kern-Isberner. A transformation system for unique minimal normal forms of conditional knowledge bases.
  • Tommaso Flaminio, Lluis Godo and Hykel Hosni. On the Boolean structure of conditional events and its logical counterpart.

to top

Session “Logics” (Thursday morning)

Chair: Hélène Fargier.

  • Davide Ciucci and Didier Dubois. A two-tiered propositional framework for handling multisource inconsistent information.
  • Nadia Creignou, Raida Ktari and Odile Papini. Complexity of model checking for cardinality-based belief revision operators.

to top

Session “Probabilistic Logics” (Thursday afternoon)

Chair: Gert de Cooman.

  • Gian Luca Pozzato. Reasoning in description logics with typicalities and probabilities of exceptions.
  • John Grant, Cristian Molinaro and Francesco Parisi. Count queries in probabilistic spatio-temporal knowledge bases with capacity constraints.
  • Giuseppe Sanfilippo, Niki Pfeifer and Angelo Gilio. Generalized probabilistic modus ponens.
  • Nenad Savic, Dragan Doder and Zoran Ognjanovic. A first-order logic for reasoning about higher-order upper and lower probabilities.

to top

Session “Probabilistic Programming” (Thursday afternoon)

Chair: Christoph Beierle.

  • Tjitze Rienstra. RankPL: a qualitative probabilistic programming language.
  • Fabio Cozman and Denis Mauá. The complexity of inferences and explanations in probabilistic logic programming.
  • Christoph Jansen, Thomas Augustin and Georg Schollmeyer. Decision theory meets linear optimization beyond computation.

to top

Session “Fuzzy” (Thursday afternoon)

Chair: Lluis Godo.

  • Andrea Campagner and Davide Ciucci. Measuring uncertainty in orthopairs.
  • Stefano Aguzzoli, Matteo Bianchi, Brunella Gerla and Diego Valota. Probability measures in Goedel-Delta logic.
  • Giulianella Coletti, Davide Petturiti and Barbara Vantaggi. Fuzzy weighted attribute combinations based similarity measures.
  • Jean-Philippe Poli, Laurence Boudet, Espinosa Bruno and Laurence Cornez. Online fuzzy temporal operators for complex system monitoring.

to top

Poster Session #1 (Monday afternoon)

Chair: Jasper De Bock.

Poster-only contributions (with spotlight presentation)

  • Paul Fink and Gero Walter. Updated and Extended Network Analysis of the Imprecise Probability Community based on ISIPTA Electronic Proceedings.
  • Cristina Rottondi, Alexander Erreygers, Giacomo Verticale and Jasper De Bock. Modelling Spectrum Assignment in a Two-Service Flexi-Grid Optical Link with Imprecise Continuous-Time Markov Chains.
  • Milan Studený and Václav Kratochvíl. Implementation of linear core-based criterion for testing extreme exact games.

Regular papers (no spotlight presentation)

  • Thomas Augustin and Rudolf Seising. Kurt Weichselberger’s Contribution to Imprecise Probabilities.
  • Marco Cattaneo. Empirical interpretation of imprecise probabilities.
  • Gert de Cooman and Jasper De Bock. Computable randomness is inherently imprecise.
  • Fabio Cozman. Evenly convex credal sets.
  • Matthias Troffaes and Ullrika Sahlin. Imprecise swing weighting for multi-attribute utility elicitation based on partial preferences.
  • Arthur Van Camp and Gert de Cooman. Exchangeable choice functions.
  • Jiji Zhang, Hailin Liu and Teddy Seidenfeld. Agreeing to disagree and dilation.

to top

Poster Session #2 (Friday morning)

Chair: Jasper De Bock.

Poster-only contributions (with spotlight presentation)

  • Marco de Angelis, Scott Ferson and Luke Green. Statistics for imprecise data: the key for enlarging the IP community.
  • Eva Endres, Paul Fink and Thomas Augustin. Imprecise Imputation for Statistical Matching.
  • Alexander Erreygers and Jasper De Bock. Handling the State Space Explosion of Markov chains: How Lumping Introduces Imprecision (Almost) Inevitably.
  • Thomas Fetz. Efficient Computation of Upper Probabilities of Failure Using Monte Carlo Simulation and Reweighting Techniques.
  • Lianmeng Jiao and Xiaojiao Geng. Analysis and Extension of the Evidential Reasoning Algorithm for Multiple Attribute Decision Analysis with Uncertainty.

Regular papers (no spotlight presentation)

  • Alexander Erreygers and Jasper De Bock. Imprecise Continuous-time Markov chains: efficient computational methods with guaranteed error bounds.
  • Enrique Miranda and Ignacio Montes. Game solutions, probability transformations and the core.
  • Ignacio Montes, Enrique Miranda and Sébastien Destercke. A study of the pari-mutuel model from the point of view of imprecise probabilities.
  • Lalintha G. Polpitiya, Kamal Premaratne, Manohar N. Murthi and Dilip Sarkar. Efficient computation of belief theoretic conditionals.

to top

Poster Session #3 (Friday morning)

Chair: Jasper De Bock.

Poster-only contributions (with spotlight presentation)

  • Scott Ferson and Kari Sentz. Dependence among probability boxes in fault trees.
  • Maja Kirkeby and Holger Bock Axelsen. Beliefs and Plausibilities in Abstract Interpretation.
  • Meizhu Li, Jasper De Bock and Gert De Cooman. Imprecise classification of the gram status of the causal pathogen of Clinical Mastitis.
  • Sabina Marchetti. The Soft Propagation algorithm: a proposal for responsive belief revision with Bayesian Networks.
  • Natan T’Joens, Gert De Cooman, Arthur Van Camp and Jasper De Bock. Active elicitation of imprecise probability models.
  • Arthur Van Camp, Gert de Cooman and Enrique Miranda. (Irrelevant) natural extension of choice functions.

Regular papers (no spotlight presentation)

  • Chiara Corsato, Renato Pelessoni and Paolo Vicig. Weak Dutch Books versus strict consistency with lower previsions.
  • Jasper De Bock. Independent natural extension for infinite spaces: Williams-coherence to the rescue.
  • Thomas Krak, Jasper De Bock and Arno Siebes. Efficient computation of updated lower expectations for imprecise continuous-time hidden Markov chains.

to top