default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th ISIPTA 2025: Bielefeld, Germany
- Sébastien Destercke, Alexander Erreygers, Max Nendel, Frank Riedel, Matthias C. M. Troffaes:
International Symposium on Imprecise Probabilities: Theories and Applications, 15-18 July 2025, Bielefeld, Germany. Proceedings of Machine Learning Research 290, PMLR 2025 - Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
The AI off-switch problem as a signalling game: bounded rationality and incomparability. 1-11 - Kevin Blackwell:
Coherent rejection functions for arbitrary things. 12-22 - Andrey G. Bronevich, Igor N. Rozenberg:
D-separation for the strong extension and the main natural extension of a credal network. 23-32 - Michele Caprio:
Optimal transport for ε-contaminated credal sets. 33-46 - Michele Caprio, Yusuf Sale, Eyke Hüllermeier:
Conformal prediction regions are imprecise highest density regions. 47-59 - Leonardo Cella:
Distribution-free possibilistic inference on conditional quantities. 60-70 - Wenlong Chen, Cyprien Gilet, Benjamin Quost, Sébastien Destercke:
Credal discrete classifier. 71-81 - Kathelijne Coussement, Gert de Cooman, Keano De Vos:
Conditioning and AGM-like belief change in the Desirability-Indifference framework. 82-92 - Fábio G. Cozman, Radu Marinescu, Junkyu Lee, Alexander Gray, Denis Deratani Mauá:
Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks. 93-102 - Justyna Dabrowska, Arthur Van Camp, Erik Quaeghebeur:
The marginal problem for sets of desirable gamble sets. 103-114 - Jasper De Bock, Alexander Erreygers, Floris Persiau:
A convenient characterisation of convergent upper transition operators. 115-125 - Adrián Detavernier, Jasper De Bock:
Robustness quantification: a new method for assessing the reliability of the predictions of a classifier. 126-136 - Keano De Vos, Gert de Cooman:
Conditioning through indifference in quantum mechanics. 137-147 - Marc Fischer:
Time-slice Bayesianism as a potential solution to the problem of dilation and reflection for imprecise probabilities. 148-157 - Marc Fischer, Loïc Favergeon:
Precise and imprecise Bayesianism applied to gas-solid reactions. 158-168 - Jürgen Landes, Sébastien Destercke:
On the value of varied evidence for imprecise probabilities. 169-182 - Ryan Martin:
Decision-theoretic properties of possibilistic inferential models. 183-195 - Enrique Miranda, Ignacio Montes:
On the closure of aggregation rules for imprecise probabilities. 196-206 - David Nieto-Barba, Ignacio Montes, Enrique Miranda:
Distorting lower probabilities using common distortion models. 207-217 - Davide Petturiti, Barbara Vantaggi:
Dynamic α-DS mixture pricing in a market with bid-ask spreads. 218-230 - Marco Sangalli, Thomas Krak, Cassio de Campos:
Towards conservative inference in credal networks using belief functions: the case of credal chains. 231-241 - Mark J. Schervish, Teddy Seidenfeld, Ruobin Gong, Joseph B. Kadane, Rafael Bassi Stern:
Elicitation for sets of probabilities and distributions. 242-251 - Damjan Skulj:
Random walks on graphs with interval weights as a model of reversible imprecise Markov chains. 252-262 - Wolfgang Spohn:
Rank-based decision theory and conditional deontic logic. 263-272 - Matthias C. M. Troffaes, Lorenzo Casini, Jürgen Landes, Ullrika Sahlin:
A robust Bayesian model to quantify and adjust for study quality and conflict of interest in meta-analyses. 273-284 - Gregory Wheeler:
Function-coherent gambles. 285-295 - Gregory Wheeler:
Function-coherent gambles with non-additive sequential dynamics. 296-306
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 2025-10-19 21:55 CEST 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:
