MIVAR: Transition from Productions to Bipartite Graphs MIVAR Nets and
  Practical Realization of Automated Constructor of Algorithms Handling More
  than Three Million Production Rules
  The theoretical transition from the graphs of production systems to the
bipartite graphs of the MIVAR nets is shown. Examples of the implementation of
the MIVAR nets in the formalisms of matrixes and graphs are given. The linear
computational complexity of algorithms for automated building of objects and
rules of the MIVAR nets is theoretically proved. On the basis of the MIVAR nets
the UDAV software complex is developed, handling more than 1.17 million objects
and more than 3.5 million rules on ordinary computers. The results of
experiments that confirm a linear computational complexity of the MIVAR method
of information processing are given.
  Keywords: MIVAR, MIVAR net, logical inference, computational complexity,
artificial intelligence, intelligent systems, expert systems, General Problem
Solver.
