Abstract: The present disclosure describes computer-implemented methods and systems for providing and maintaining a limited iterative ontological notation (FIG. 1), built upon a three-value logic of existence or equivalence of patterns. Methods may be embodied as a self-referencing table with a finite collection of columns or as a property graph with a small count of fixed properties and a finite collection of edge types, each carrying a particular ontological interpretation and use. Isolation of information content from context and application of three value logic to pattern recognition produces a finite set of indexed notations which allow for leveraging of a fixed schema to enhance computing performance, reduce memory utilization and improve accessibility though enabling a user interface that does not require prior knowledge of graph database programming languages.

Abstract: The present disclosure describes computer-implemented methods and systems for providing and maintaining a limited iterative ontological notation (FIG. 1), built upon a three-value logic of existence or equivalence of patterns. Methods may be embodied as a self-referencing table with a finite collection of columns or as a property graph with a small count of fixed properties and a finite collection of edge types, each carrying a particular ontological interpretation and use. Isolation of information content from context and application of three value logic to pattern recognition produces a finite set of indexed notations which allow for leveraging of a fixed schema to enhance computing performance, reduce memory utilization and improve accessibility though enabling a user interface that does not require prior knowledge of graph database programming languages.