default search action
Jasper De Bock
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Jasper De Bock, Gert De Cooman, Cassio P. de Campos:
Extended papers from the 11th International Symposium on Imprecise Probabilities: Theories and Applications. Int. J. Approx. Reason. 168: 109150 (2024) - [j22]Gert de Cooman
, Arthur Van Camp
The logic behind desirable sets of things, and its filter representation. Int. J. Approx. Reason. 172: 109241 (2024) - [i15]Arne Decadt, Alexander Erreygers, Jasper De Bock:
Extending choice assessments to choice functions: An algorithm for computing the natural extension. CoRR abs/2407.21164 (2024) - 2023
- [j21]Andrés Cano
The Twelfth International Symposium on Imprecise Probabilities: Theories and Applications (ISIPTA-21). Int. J. Approx. Reason. 152: 355-356 (2023) - [c38]Jasper De Bock:
A theory of desirable things. ISIPTA 2023: 141-152 - [c37]Gert de Cooman, Arthur Van Camp, Jasper De Bock:
Desirable sets of things and their logic. ISIPTA 2023: 153-164 - [c36]Keano De Vos, Gert de Cooman, Jasper De Bock:
Indistinguishability through exchangeability in quantum mechanics? ISIPTA 2023: 177-188 - [c35]Yema Paul, Alexander Erreygers, Jasper De Bock:
Expected time averages in Markovian imprecise jump processes: a graph-theoretic characterisation of weak ergodicity. ISIPTA 2023: 379-389 - [i14]Jasper De Bock:
A theory of desirable things. CoRR abs/2302.07412 (2023) - [i13]Gert de Cooman, Arthur Van Camp, Jasper De Bock:
The logic behind desirable sets of things, and its filter representation. CoRR abs/2302.08176 (2023) - 2022
- [j20]Gert de Cooman
Randomness is inherently imprecise. Int. J. Approx. Reason. 141: 28-68 (2022) - [j19]Alexander Erreygers, Jasper De Bock:
Markovian imprecise jump processes: Extension to measurable variables, convergence theorems and algorithms. Int. J. Approx. Reason. 147: 78-124 (2022) - [j18]Floris Persiau
On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness. Int. J. Approx. Reason. 151: 272-291 (2022) - [i12]Arne Decadt, Alexander Erreygers, Jasper De Bock, Gert de Cooman:
Decision-making with E-admissibility given a finite assessment of choices. CoRR abs/2204.07428 (2022) - 2021
- [j17]Natan T'Joens
A particular upper expectation as global belief model for discrete-time finite-state uncertain processes. Int. J. Approx. Reason. 131: 30-55 (2021) - [j16]Natan T'Joens
Average behaviour in discrete-time imprecise Markov chains: A study of weak ergodicity. Int. J. Approx. Reason. 132: 181-205 (2021) - [c34]Floris Persiau
The Smallest Probability Interval a Sequence Is Random for: A Study for Six Types of Randomness. ECSQARU 2021: 442-454 - [c33]Jasper De Bock, Natan T'Joens:
Average Behaviour of Imprecise Markov Chains: A Single Pointwise Ergodic Theorem for Six Different Models. ISIPTA 2021: 90-99 - [c32]Gert de Cooman, Jasper De Bock:
Randomness and Imprecision: A Discussion of Recent Results. ISIPTA 2021: 110-121 - [c31]Alexander Erreygers, Jasper De Bock:
Extending the Domain of Imprecise Jump Processes from Simple Variables to Measurable Ones. ISIPTA 2021: 140-149 - [c30]Floris Persiau, Jasper De Bock, Gert de Cooman:
A Remarkable Equivalence between Non-Stationary Precise and Stationary Imprecise Uncertainty Models in Computable Randomness. ISIPTA 2021: 244-253 - [c29]Natan T'Joens, Jasper De Bock:
Global Upper Expectations for Discrete-Time Stochastic Processes: In Practice, They Are All The Same! ISIPTA 2021: 310-319 - [c28]Jasper De Bock, Alexander Erreygers, Thomas Krak:
Sum-product laws and efficient algorithms for imprecise Markov chains. UAI 2021: 1476-1485 - [e2]Andrés Cano, Jasper De Bock, Enrique Miranda, Serafín Moral:
International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2021, 6-9 July 2021, University of Granada, Granada, Spain. Proceedings of Machine Learning Research 147, PMLR 2021 [contents] - [i11]Jasper De Bock, Gert de Cooman:
On a notion of independence proposed by Teddy Seidenfeld. CoRR abs/2102.10342 (2021) - 2020
- [j15]Meizhu Li, Shaoguang Huang, Jasper De Bock
A Robust Dynamic Classifier Selection Approach for Hyperspectral Images with Imprecise Label Information. Sensors 20(18): 5262 (2020) - [c27]Jasper De Bock:
Archimedean Choice Functions - An Axiomatic Foundation for Imprecise Decision Making. IPMU (2) 2020: 195-209 - [c26]Natan T'Joens
Limit Behaviour of Upper and Lower Expected Time Averages in Discrete-Time Imprecise Markov Chains. IPMU (2) 2020: 224-238 - [c25]Arne Decadt, Jasper De Bock, Gert de Cooman
Inference with Choice Functions Made Practical. SUM 2020: 113-127 - [c24]Floris Persiau
Computable Randomness Is About More Than Probabilities. SUM 2020: 172-186 - [i10]Jasper De Bock:
Archimedean Choice Functions: an Axiomatic Foundation for Imprecise Decision Making. CoRR abs/2002.05196 (2020) - [i9]Jasper De Bock:
Choice functions based on sets of strict partial orders: an axiomatic characterisation. CoRR abs/2003.11631 (2020) - [i8]Arne Decadt, Jasper De Bock, Gert de Cooman:
Inference with Choice Functions Made Practical. CoRR abs/2005.03098 (2020)
2010 – 2019
- 2019
- [j14]Jasper De Bock
Independent natural extension for infinite spaces. Int. J. Approx. Reason. 104: 84-107 (2019) - [j13]Alexander Erreygers, Jasper De Bock:
Bounding inferences for large-scale continuous-time Markov chains: A new approach based on lumping and imprecise Markov chains. Int. J. Approx. Reason. 115: 96-133 (2019) - [c23]Natan T'Joens
A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains. ECSQARU 2019: 455-465 - [c22]Jasper De Bock, Gert de Cooman:
Interpreting, Axiomatising and Representing Coherent Choice Functions in Terms of Desirability. ISIPTA 2019: 125-134 - [c21]Arne Decadt, Gert de Cooman, Jasper De Bock:
Monte Carlo Estimation for Imprecise Probabilities: Basic Properties. ISIPTA 2019: 135-144 - [c20]Alexander Erreygers, Jasper De Bock:
First Steps Towards an Imprecise Poisson Process. ISIPTA 2019: 175-184 - [c19]Thomas E. Krak, Natan T'Joens, Jasper De Bock:
Hitting Times and Probabilities for Imprecise Markov Chains. ISIPTA 2019: 265-275 - [c18]Natan T'Joens, Jasper De Bock, Gert de Cooman:
In Search of a Global Belief Model for Discrete-Time Uncertain Processes. ISIPTA 2019: 377-385 - [e1]Jasper De Bock, Cassio P. de Campos, Gert de Cooman, Erik Quaeghebeur, Gregory R. Wheeler:
International Symposium on Imprecise Probabilities: Theories and Applications, ISIPTA 2019, 3-6 July 2019, Thagaste, Ghent, Belgium. Proceedings of Machine Learning Research 103, PMLR 2019 [contents] - [i7]Jasper De Bock, Gert de Cooman:
An alternative approach to coherent choice functions. CoRR abs/1903.00336 (2019) - 2018
- [j12]Alexander Erreygers
Imprecise Markov Models for Scalable and Robust Performance Evaluation of Flexi-Grid Spectrum Allocation Policies. IEEE Trans. Commun. 66(11): 5401-5414 (2018) - [c17]Jasper De Bock, Gert de Cooman
A Desirability-Based Axiomatisation for Coherent Choice Functions. SMPS 2018: 46-53 - [c16]Alexander Erreygers, Jasper De Bock:
Computing Inferences for Large-Scale Continuous-Time Markov Chains by Combining Lumping with Imprecision. SMPS 2018: 78-86 - [c15]Thomas E. Krak, Alexander Erreygers, Jasper De Bock:
An Imprecise Probabilistic Estimator for the Transition Rate Matrix of a Continuous-Time Markov Chain. SMPS 2018: 124-132 - [c14]Meizhu Li, Jasper De Bock, Gert de Cooman
Dynamic Classifier Selection Based on Imprecise Probabilities: A Case Study for the Naive Bayes Classifier. SMPS 2018: 149-156 - [c13]Natan T'Joens
Continuity of the Shafer-Vovk-Ville Operator. SMPS 2018: 200-207 - [i6]Alexander Erreygers, Cristina Rottondi, Giacomo Verticale
Imprecise Markov Models for Scalable and Robust Performance Evaluation of Flexi-Grid Spectrum Allocation Policies. CoRR abs/1801.05700 (2018) - [i5]Thomas E. Krak, Alexander Erreygers, Jasper De Bock:
An Imprecise Probabilistic Estimator for the Transition Rate Matrix of a Continuous-Time Markov Chain. CoRR abs/1804.01330 (2018) - [i4]Jasper De Bock, Gert de Cooman:
A Desirability-Based Axiomatisation for Coherent Choice Functions. CoRR abs/1806.01044 (2018) - 2017
- [j11]Stavros Lopatatzidis, Jasper De Bock, Gert de Cooman
Computing lower and upper expected first-passage and return times in imprecise birth-death chains. Int. J. Approx. Reason. 80: 137-173 (2017) - [j10]Jasper De Bock
Credal networks under epistemic irrelevance. Int. J. Approx. Reason. 85: 107-138 (2017) - [j9]Thomas E. Krak, Jasper De Bock
Imprecise continuous-time Markov chains. Int. J. Approx. Reason. 88: 452-528 (2017) - [j8]Jasper De Bock
The Limit Behaviour of Imprecise Continuous-Time Markov Chains. J. Nonlinear Sci. 27(1): 159-196 (2017) - [c12]Gert de Cooman, Jasper De Bock, Márcio Alves Diniz:
Coherent Predictive Inference under Exchangeability with Imprecise Probabilities (Extended Abstract). IJCAI 2017: 4995-4999 - [c11]Jasper De Bock:
Independent Natural Extension for Infinite Spaces: Williams-Coherence to the Rescue. ISIPTA 2017: 121-132 - [c10]Gert de Cooman, Jasper De Bock:
Computable Randomness is Inherently Imprecise. ISIPTA 2017: 133-144 - [c9]Alexander Erreygers, Jasper De Bock:
Imprecise Continuous-Time Markov Chains: Efficient Computational Methods with Guaranteed Error Bounds. ISIPTA 2017: 145-156 - [c8]Thomas E. Krak, Jasper De Bock, Arno Siebes:
Efficient Computation of Updated Lower Expectations for Imprecise Continuous-Time Hidden Markov Chains. ISIPTA 2017: 193-204 - [i3]Jasper De Bock:
Credal Networks under Epistemic Irrelevance. CoRR abs/1701.08661 (2017) - 2016
- [j7]Jasper De Bock, Arthur Van Camp
Representation theorems for partially exchangeable random variables. Fuzzy Sets Syst. 284: 1-30 (2016) - [j6]Gert de Cooman
Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems. Int. J. Approx. Reason. 76: 18-46 (2016) - [j5]Stavros Lopatatzidis, Jasper De Bock, Gert de Cooman
Robust queueing theory: an initial study using imprecise probabilities. Queueing Syst. Theory Appl. 82(1-2): 75-101 (2016) - [c7]Janneke H. Bolt, Jasper De Bock, Silja Renooij
Exploiting Bayesian Network Sensitivity Functions for Inference in Credal Networks. ECAI 2016: 646-654 - [c6]Jasper De Bock:
Reintroducing Credal Networks under Epistemic Irrelevance. Probabilistic Graphical Models 2016: 123-135 - 2015
- [j4]Jasper De Bock, Gert de Cooman
Credal networks under epistemic irrelevance: The sets of desirable gambles approach. Int. J. Approx. Reason. 56: 178-207 (2015) - [j3]Jasper De Bock, Gert de Cooman
Conditioning, updating and lower probability zero. Int. J. Approx. Reason. 67: 1-36 (2015) - [j2]Gert De Cooman
Coherent Predictive Inference under Exchangeability with Imprecise Probabilities. J. Artif. Intell. Res. 52: 1-95 (2015) - 2014
- [j1]Jasper De Bock, Gert de Cooman
An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models. J. Artif. Intell. Res. 50: 189-233 (2014) - [c5]Jasper De Bock, Cassio P. de Campos, Alessandro Antonucci:
Global Sensitivity Analysis for MAP Inference in Graphical Models. NIPS 2014: 2690-2698 - [c4]Cedric De Boom, Jasper De Bock, Arthur Van Camp
Robustifying the Viterbi Algorithm. Probabilistic Graphical Models 2014: 160-175 - 2013
- [c3]Jasper De Bock, Gert de Cooman:
Extreme Lower Previsions and Minkowski Indecomposability. ECSQARU 2013: 157-168 - 2012
- [c2]Gert de Cooman
Recent advances in imprecise-probabilistic graphical models. ECAI 2012: 27-32 - [c1]Jasper De Bock, Gert de Cooman
Imprecise Bernoulli Processes. IPMU (3) 2012: 400-409 - [i2]Jasper De Bock, Gert de Cooman:
Credal nets under epistemic irrelevance. CoRR abs/1208.1136 (2012) - [i1]Jasper De Bock, Gert de Cooman:
An efficient algorithm for estimating state sequences in imprecise hidden Markov models. CoRR abs/1210.1791 (2012)
Coauthor Index
aka: Gert De Cooman
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:46 CET 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: