Computational architecture for reasoning involving extensible graphical representations
First Claim
1. A computer implemented method for assisting a user engaged in a reasoning task, the method comprising:
- a) storing in a memory a data structure comprising;
i) a partially ordered set of nodes comprising a set of nodes N and a partial ordering of N,ii) a set R of representations, wherein at least one representation r in R is a graphical representation comprising a set of edits d0, . . . , dL, wherein L≧
0, andiii) a function f;
r→
N assigning to each edit di in r an associated node f(di) in N, wherein f(di)≧
f(d0) for all i;
b) displaying to the user an instance r[n] of the representation r at a user-selected node n, wherein the instance r[n]={di in r such that n≧
f(di)≧
f(d0)};
c) receiving from the user an instruction to introduce at the node n in N an edit dL+1 to the graphical representation r; and
d) modifying the data structure to introduce at n the edit dL+1 to r, provided;
i) n≧
f(d0); and
ii) r is extensible, or n=f(d0), or the edit dL+1 at n does not extend r.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer architecture supports reasoning tasks involving information represented in graphical form. The architecture supports the creation, storing, display, and editing of a partially ordered set of nodes representing the steps in a reasoning process, as well as representations of information associated with the nodes. Modifications are constrained by rules that support the creation of valid reasoning. In particular, special rules of inheritance place constraints upon what information is available for display and modification at any given point in the reasoning process. The present architecture supports reasoning about any type of graphical representation and about multiple representations within a single reasoning process. In addition, the present architecture supports extensible representations, i.e., representations that may be edited at later points in a proof to extend the range of possible values which may be assigned to their attributes, or to add or delete objects or attributes. The architecture can simultaneously support and integrate the structured reasoning involving both sentential and graphical representations of information. The techniques provided by the invention have application to a wide variety of engineering and scientific practices by improving the processes through which designs and problem solutions are created, assessed, and communicated. It has particular importance and value for complex collaborative projects.
57 Citations
7 Claims
-
1. A computer implemented method for assisting a user engaged in a reasoning task, the method comprising:
-
a) storing in a memory a data structure comprising; i) a partially ordered set of nodes comprising a set of nodes N and a partial ordering of N, ii) a set R of representations, wherein at least one representation r in R is a graphical representation comprising a set of edits d0, . . . , dL, wherein L≧
0, andiii) a function f;
r→
N assigning to each edit di in r an associated node f(di) in N, wherein f(di)≧
f(d0) for all i;b) displaying to the user an instance r[n] of the representation r at a user-selected node n, wherein the instance r[n]={di in r such that n≧
f(di)≧
f(d0)};c) receiving from the user an instruction to introduce at the node n in N an edit dL+1 to the graphical representation r; and d) modifying the data structure to introduce at n the edit dL+1 to r, provided; i) n≧
f(d0); andii) r is extensible, or n=f(d0), or the edit dL+1 at n does not extend r. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
Specification