Ascriptive and descriptive entities for process and translation: a limited iterative ontological notation

    公开(公告)号:US11341418B2

    公开(公告)日:2022-05-24

    申请号:US16190003

    申请日:2018-11-13

    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. Implementation embodiments include but are not limited to, formulaic, cyclical, graphical, tabular, Cartesian, hierarchical, object-oriented and transactional information sources.

    ASCRIPTIVE AND DESCRIPTIVE ENTITIES FOR PROCESS AND TRANSLATION: A LIMITED ITERATIVE ONTOLOGICAL NOTATION

    公开(公告)号:US20200151582A1

    公开(公告)日:2020-05-14

    申请号:US16190003

    申请日:2018-11-13

    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. Implementation embodiments include but are not limited to, formulaic, cyclical, graphical, tabular, Cartesian, hierarchical, object-oriented and transactional information sources.

Patent Agency Ranking