Ordered valuation algebras: A generic framework for approximating inference
From MaRDI portal
Publication:1879778
DOI10.1016/j.ijar.2003.10.009zbMath1093.68115OpenAlexW2030058150MaRDI QIDQ1879778
Publication date: 23 September 2004
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2003.10.009
Related Items (12)
On a condition for semirings to induce compact information algebras. ⋮ Updating credal networks is approximable in polynomial time ⋮ Semiring induced valuation algebras: exact and approximate local computation algorithms ⋮ An algebraic theory for data linkage ⋮ Contextuality in distributed systems ⋮ On conditions for semirings to induce compact information algebras ⋮ An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ Two Cartesian closed categories of information algebras ⋮ On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras ⋮ Compatibility, desirability, and the running intersection property ⋮ ON TWO TYPES OF CONTINUOUS INFORMATION ALGEBRAS ⋮ Non-locality, contextuality and valuation algebras: a general theory of disagreement
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Allocation of arguments and evidence theory
- Consonant approximations of belief functions
- Propagating belief functions in qualitative Markov trees
- Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
- The transferable belief model
- Resource bounded and anytime approximation of belief function computations.
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
- Bucket elimination: A unifying framework for reasoning
- INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
- Mini-buckets
- Probabilistic Networks and Expert Systems
- A computationally efficient approximation of Dempster-Shafer theory
- Propositional information systems
- Upper and Lower Probabilities Induced by a Multivalued Mapping
This page was built for publication: Ordered valuation algebras: A generic framework for approximating inference
