English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The theoretical transition from the graphs of production systems to thebipartite graphs of the MIVAR nets is shown. Examples of the implementation ofthe MIVAR nets in the formalisms of matrixes and graphs are given. The linearcomputational complexity of algorithms for automated building of objects andrules of the MIVAR nets is theoretically proved. On the basis of the MIVAR netsthe UDAV software complex is developed, handling more than 1.17 million objectsand more than 3.5 million rules on ordinary computers. The results ofexperiments that confirm a linear computational complexity of the MIVAR methodof information processing are given.  Keywords: MIVAR, MIVAR net, logical inference, computational complexity,artificial intelligence, intelligent systems, expert systems, General ProblemSolver.

MIVAR: Transition from Productions to Bipartite Graphs MIVAR Nets and  Practical Realization of Automated Constructor of Algorithms Handling More  than Three Million Production Rules