Algebras of Information. An Axiomatic Foundation
Juerg Kohlas

TL;DR
This paper develops a generalized algebraic framework for information systems, extending valuation algebras, and explores their properties, including local computation, duality, and uncertain information, generalizing Dempster-Shafer theory.
Contribution
It introduces a new axiomatic system for information algebras based on a broader system of questions, extending valuation algebras and unifying various models.
Findings
Classical valuation algebras are a special case of the new system.
The paper discusses local computation and duality in information algebras.
It generalizes Dempster-Shafer theory to uncertain information using random maps.
Abstract
The basic idea behind information algebras is that information comes in pieces, each referring to a certain question, that these pieces can be combined or aggregated and that the part relating to a given question can be extracted. This algebraic structure can be given different forms. Questions were originally represented by subsets of variables. Pieces of information were then represented by valuations associated with the domains of variables. This leads to an algebraic structure called valuation algebras. The basic axiomatics of this algebraic structure was in essence proposed by Shenoy and Shafer. Here a much more general view of systems of questions is proposed and pieces of information are related to the elements of this system of questions. This leads to a new and extended system of axioms for information algebras. Classical valuation algebras are essentially a special case of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge
