Concept-Relation Algebra (original) (raw)

Extension of lambda calculus applied on graph theory. It is meant to compute the functional relation between distant nodes in graphs called "concept-relation" graphs. Can be used to superseed linear algebra, fuzzy logic and cloud clustering. Revised: - Added support for arc ordering - Changed some algorithms and definitions, to make them aware of possible arcs order. - Simplified key definitions - Changed key terms to avoid confusion (e.g. "composition function" -> "coalesce function"). - Minor corrections to text flow - Proofread of the new parts.