An Extension of Specificity-Based Approximations to Other Belief Function Relations

DOI10.1007/978-3-030-88601-1_23zbMath1518.68395MaRDI QIDQ6488073

Tekwa Tedjini, Éric Lefèvre, Sohaib Afifi, Frédéric Pichon

Publication date: 24 March 2023

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Consonant approximations of belief functions
• Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
• Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
• The capacitated vehicle routing problem with evidential demands
• Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
• From set relations to belief function relations
• Formulations and exact algorithms for the vehicle routing problem with time windows
• INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
• Computational aspects of the Mobius transformation of graphs
• A computationally efficient approximation of Dempster-Shafer theory

This page was built for publication: An Extension of Specificity-Based Approximations to Other Belief Function Relations