Arthur Van Camp

Orcid: 0000-0001-9066-5425

According to our database1, Arthur Van Camp authored at least 17 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The logic behind desirable sets of things, and its filter representation.
Int. J. Approx. Reason., 2024

Inferring from an imprecise Plackett-Luce model: Application to label ranking.
Fuzzy Sets Syst., 2024

2023
Independent natural extension for choice functions.
Int. J. Approx. Reason., 2023

A study of Jeffrey's rule with imprecise probability models.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2023

Desirable sets of things and their logic.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2023

2022
Exposing some points of interest about non-exposed points of desirability.
Int. J. Approx. Reason., 2022

2020
Modelling epistemic irrelevance with choice functions.
Int. J. Approx. Reason., 2020

2019
Irrelevant Natural Extension for Choice Functions.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

2018
Lexicographic choice functions.
Int. J. Approx. Reason., 2018

Exchangeable choice functions.
Int. J. Approx. Reason., 2018

Coherent choice functions, desirability and indifference.
Fuzzy Sets Syst., 2018

Natural Extension of Choice Functions.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

2016
Representation theorems for partially exchangeable random variables.
Fuzzy Sets Syst., 2016

Lexicographic Choice Functions Without Archimedeanicity.
Proceedings of the Soft Methods for Data Science, 2016

2014
Robustifying the Viterbi Algorithm.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

2012
A New Method for Learning Imprecise Hidden Markov Models.
Proceedings of the Advances in Computational Intelligence, 2012

Recent advances in imprecise-probabilistic graphical models.
Proceedings of the ECAI 2012, 2012


  Loading...