Information Algebra
Jürg Kohlas, Marc Pouly, Cesar Schneuwly · Wiley Encyclopedia of Computer Science and Engineering · 2008
Abstract Many different problems from computer science can be solved by fast, generic algorithms because they develop from instances of very general abstract structure called information algebra . In this article, an overview of algebraic methods is presented, and several examples of these methods are given. In the second section, axiomatics is described. In the third section, semiring valuations are presented. Then, local computation is introduced, and an efficient algorithm in a valuation algebra is described. Last, idempotency law is explained and examples are provided.