Composition of Credal Sets via Polyhedral Geometry
This work addresses computational efficiency issues for researchers in uncertainty reasoning and credal set theory, but it appears incremental as it builds on an existing composition operator.
The paper tackles the computational challenges of composing credal sets, a multidimensional modeling framework, by applying polyhedral geometry methods to analyze the composition operator's computational potential.
Recently introduced composition operator for credal sets is an analogy of such operators in probability, possibility, evidence and valuation-based systems theories. It was designed to construct multidimensional models (in the framework of credal sets) from a system of low- dimensional credal sets. In this paper we study its potential from the computational point of view utilizing methods of polyhedral geometry.