About: Dealing with uncertainty has always been a challenging topic in the area of knowledge representation. Nowadays, as the internet provides a vast platform for knowledge exploitation, the need becomes even more imminent. The kind of uncertainty encountered in most of these cases as well as its distributed nature make Dempster-Shafer (D-S) Theory to be an appropriate framework for its representation. However, we have to face the drawback of the computation burden of Dempster’s rule of combination due to its combinatorial behavior. Constraint Programming (CP) has proved to be an efficient tool in cases where results have to satisfy some specified properties and pruning of the computation space can be achieved. As D-S theory measures’ computation fulfills this requirement, CP seems a promising framework to employ for this purpose. In this paper, we present our approach to use CP to compute the belief and plausibility measures of D-S Theory and Dempster’s rule of combination as well as the results of the effort. As it was expected, the results are quite promising and in many cases impressive.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : wasabi.inria.fr associated with source document(s)

AttributesValues
type
value
  • Dealing with uncertainty has always been a challenging topic in the area of knowledge representation. Nowadays, as the internet provides a vast platform for knowledge exploitation, the need becomes even more imminent. The kind of uncertainty encountered in most of these cases as well as its distributed nature make Dempster-Shafer (D-S) Theory to be an appropriate framework for its representation. However, we have to face the drawback of the computation burden of Dempster’s rule of combination due to its combinatorial behavior. Constraint Programming (CP) has proved to be an efficient tool in cases where results have to satisfy some specified properties and pruning of the computation space can be achieved. As D-S theory measures’ computation fulfills this requirement, CP seems a promising framework to employ for this purpose. In this paper, we present our approach to use CP to compute the belief and plausibility measures of D-S Theory and Dempster’s rule of combination as well as the results of the effort. As it was expected, the results are quite promising and in many cases impressive.
Subject
  • Belief
  • Decentralization
  • Constraint programming
  • Dempster–Shafer theory
  • Programming paradigms
  • Combinatorics
  • Declarative programming
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software