发明授权
US6064953A Method for creating a disjunctive edge graph from subtrees during
unification
失效
在统一期间从子树创建分离边缘图的方法
- 专利标题: Method for creating a disjunctive edge graph from subtrees during unification
- 专利标题(中): 在统一期间从子树创建分离边缘图的方法
-
申请号: US100269申请日: 1998-06-18
-
公开(公告)号: US6064953A公开(公告)日: 2000-05-16
- 发明人: John T. Maxwell, III , Ronald M. Kaplan
- 申请人: John T. Maxwell, III , Ronald M. Kaplan
- 申请人地址: CT Stamford
- 专利权人: Xerox Corporation
- 当前专利权人: Xerox Corporation
- 当前专利权人地址: CT Stamford
- 主分类号: G06F9/44
- IPC分类号: G06F9/44 ; G06F17/27 ; G06F17/30 ; G06F17/21
摘要:
A method of unifying edge data structures using a processor. The method begins with creation of a first edge data structure and unifying it with a second edge data structure. If during unification any of the contexted lazy copy links associated with the second graph data structure are activated, then second graph data structure is expanded. Expansion involves first selecting a contexted lazy copy link from among the contexted lazy copy links associated with the second graph data, selecting a selected attribute from the subtree feature structure pointed to by the selected contexted lazy copy link, making a copy of the selected attribute and storing the copy of the selected attribute in the second graph data structure as a second attribute, and adding a contexted lazy copy link from the second attribute to the selected attribute value.
公开/授权文献
- USD426584S Shelf graphic channel 公开/授权日:2000-06-13
信息查询