Abstract: A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes. Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path. Utilizing DAG Path Addressing with bindings the memory can be organized to store a generalization hierarchy of logical propositions.

Abstract: A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes (a covering node and a covered node). Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Nodes present in the subgraph that do not cover any other nodes are leaves of the subgraph. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path.

Abstract: Methods can include receiving a graphbase comprising a first plurality of nodes and a plurality of edges representing covering-covered relationships between the nodes. Each node can comprise a plurality of node parameters such as a NodeNumber, a Reachable Interval, and an OwnTree Interval. For a traversal ordering of nodes, nodes comprised within the OwnTree Interval are reachable from the node, nodes comprised within the Reachable Interval may be reachable from the node, and nodes comprised within neither interval are not reachable by the node. Methods can additionally include the steps of receiving a first and second sub-set of nodes, the sub-sets being a sub-set of the first plurality of nodes. Furthermore, a relationship between the first and second sub-set can be determined using the NodeNumber, the OwnTree Interval, and the Reachable Interval.