information algebra

The term "information algebra" refers to mathematical techniques of information processing. Classical information theory goes back to Claude Shannon. It is a theory of information transmission, looking at communication and storage. However, it has not been considered so far that information comes from different sources and that it is therefore usually combined. It has furthermore been neglected in classical information theory that one wants to extract those parts out of a piece of information that are relevant to specific questions.

A mathematical phrasing of these operations leads to an algebra of information, describing basic modes of information processing. Such an algebra involves several formalisms of computer science, which seem to be different on the surface: relational databases, multiple systems of formal logic or numerical problems of linear algebra. It allows the development of generic procedures of information processing and thus a unification of basic methods of computer science, in particular of distributed information processing.

Information relates to precise questions, comes from different sources, must be aggregated, and can be focused on questions of interest. Starting from these considerations, information algebras are two-sorted algebras $(\Phi,D)$:

Where $\Phi$ is a semigroup, representing combination or aggregation of information, and

$D$ is a lattice of domains (related to questions) whose partial order reflects the granularity of the domain or the question, and a mixed operation representing focusing or extraction of information.

Information and its operations

More precisely, in the two-sorted algebra $(\Phi,D)$, the following operations are defined

Additionally, in $D$ the usual lattice operations (meet and join) are defined.

Axioms and definition

The axioms of the two-sorted algebra $(\Phi,D)$, in addition to the axioms of the lattice $D$:

A two-sorted algebra $(\Phi,D)$ satisfying these axioms is called an Information Algebra.

Order of information

A partial order of information can be introduced by defining $\phi \leq \psi$ if $\phi \otimes \psi = \psi$. This means that $\phi$ is less informative than $\psi$ if it adds no new information to $\psi$. The semigroup $\Phi$ is a semilattice relative to this order, i.e. $\phi \otimes \psi = \phi \vee \psi$. Relative to any domain (question) $x \in D$ a partial order can be introduced by defining $\phi \leq_ \psi$ if $\phi^ \leq \psi^$. It represents the order of information content of $\phi$ and $\psi$ relative to the domain (question) $x$.

Labeled information algebra

The pairs $(\phi,x) \$, where $\phi \in \Phi$ and $x \in D$ such that $\phi^ = \phi$ form a labeled Information Algebra. More precisely, in the two-sorted algebra $(\Phi,D) \$, the following operations are defined

Models of information algebras

Here follows an incomplete list of instances of information algebras:
*Relational algebra: The reduct of a relational algebra with natural join as combination and the usual projection is a labeled information algebra, see Example.
* Constraint systems: Constraints form an information algebra .
* Semiring valued algebras: C-Semirings induce information algebras ;;.
*Logic: Many logic systems induce information algebras . Reducts of cylindric algebras or polyadic algebras are information algebras related to predicate logic .
* Module algebras: ;.
* Linear systems: Systems of linear equations or linear inequalities induce information algebras .

Worked-out example: relational algebra

Let $$ be a set of symbols, called ''attributes'' (or ''column names''). For each $\alpha\in$ let $U_\alpha$ be a non-empty set, the set of all possible values of the attribute $\alpha$. For example, if
$= \$, then $U_$ could
be the set of strings, whereas $U_$ and $U_$ are both the set of non-negative integers.

Let $x\subseteq$. An ''$x$-tuple'' is a function $f$ so that
$\hbox(f)=x$ and $f(\alpha)\in U_\alpha$ for each $\alpha\in x$ The set
of all $x$-tuples is denoted by $E_x$. For an $x$-tuple $f$ and a subset
$y\subseteq x$ the restriction f /math> is defined to be the
$y$-tuple $g$ so that $g(\alpha)=f(\alpha)$ for all $\alpha\in y$.

A ''relation $R$ over $x$'' is a set of $x$-tuples, i.e. a subset of $E_x$.
The set of attributes $x$ is called the ''domain'' of $R$ and denoted by
$d(R)$. For $y\subseteq d(R)$ the ''projection'' of $R$ onto $y$ is defined
as follows:
:$\pi_y(R):=\.$
The ''join'' of a relation $R$ over $x$ and a relation $S$ over $y$ is
defined as follows:
:$R\bowtie S:=\.$
As an example, let $R$ and $S$ be the following relations:
:$R= \begin \texttt & \texttt \\ \texttt & \texttt \\ \texttt & \texttt \\ \end\qquad S= \begin \texttt & \texttt \\ \texttt & \texttt \\ \texttt & \texttt \\ \end$
Then the join of $R$ and $S$ is:
:$R\bowtie S= \begin \texttt & \texttt & \texttt \\ \texttt & \texttt & \texttt \\ \texttt & \texttt & \texttt \\ \end$
A relational database with natural join $\bowtie$ as combination and the usual projection $\pi$ is an information algebra.
The operations are well defined since
* $d(R\bowtie S)=d(R)\cup d(S)$
* If $x\subseteq d(R)$, then $d(\pi_x(R))=x$.
It is easy to see that relational databases satisfy the axioms of a labeled
information algebra:
; semigroup : $(R_1\bowtie R_2)\bowtie R_3=R_1\bowtie(R_2\bowtie R_3)$ and $R\bowtie S=S\bowtie R$
; transitivity : If $x\subseteq y\subseteq d(R)$, then $\pi_x(\pi_y(R))=\pi_x(R)$.
; combination : If $d(R)=x$ and $d(S)=y$, then $\pi_x(R\bowtie S)=R\bowtie\pi_(S)$.
; idempotency : If $x\subseteq d(R)$, then $R\bowtie\pi_x(R)=R$.
; support : If $x = d(R)$, then $\pi_x(R)=R$.

Connections

; Valuation algebras : Dropping the idempotency axiom leads to valuation algebras. These axioms have been introduced by to generalize ''local computation schemes'' from Bayesian networks to more general formalisms, including belief function, possibility potentials, etc. . For a book-length exposition on the topic see .
; Domains and information systems: ''Compact Information Algebras'' are related to Scott domains and Scott information systems ;;.
; Uncertain information : Random variables with values in information algebras represent '' probabilistic argumentation systems'' .
; Semantic information : Information algebras introduce semantics by relating information to questions through focusing and combination ;.
; Information flow : Information algebras are related to information flow, in particular classifications .
; Tree decomposition : Information algebras are organized into a hierarchical tree structure, and decomposed into smaller problems.
; Semigroup theory : ...
; Compositional models: Such models may be defined within the framework of information algebras: https://arxiv.org/abs/1612.02587
; Extended axiomatic foundations of information and valuation algebras: The concept of conditional independence is basic for information algebras and a new axiomatic foundation of information algebras, based on conditional independence, extending the old one (see above) is available: https://arxiv.org/abs/1701.02658

Historical Roots

The axioms for information algebras are derived from
the axiom system proposed in (Shenoy and Shafer, 1990), see also (Shafer, 1991).

References

*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
* {{Citation , first1=Nic , last1=Wilson , first2= Jérôme , last2= Mengin , chapter=Logical deduction using the local computation framework , editor=Anthony Hunter , editor2=Simon Parsons , title=Symbolic and Quantitative Approaches to Reasoning and Uncertainty, European Conference, ECSQARU'99, London, UK, July 5–9, 1999, Proceedings, volume 1638 of Lecture Notes in Computer Science , pages= 386–396 , publisher= Springer , year= 1999 , isbn = 978-3-540-66131-3 , chapter-url = http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=1638&spage=0386

Information theory
Abstract algebra