01282nas a2200181   4500000000100000000000100001008004100002260000900043653002000052653002000072653002000092653001600112100002700128245008000155300001100235490000700246520084700253       2006                            d  c200610aBoolean Algebra10aContinuous DSmT10aEvidence Theory10aProbability1 aFrédéric Dambreville00aOrdered DSmT and its Application to the Definition of Continuous DSm Models  a85-1030 v203 a<p>When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyperpower sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints. In this paper, the logical constraints will be related to a predefined order over the logical propositions. The use of such orders and their resulting logical constraints will ensure a great reduction of the model complexity. Such results will be applied to the definition of continuous DSm models. In particular, a simplified description of the continuous impreciseness is considered, based on impreciseness intervals of the sensors. From this viewpoint, it is possible to manage the contradictions between continuous sensors in a DSmT manner, while the complexity of the model stays handlable.</p>