公开(公告)号：US08468512B2

公开(公告)日：2013-06-18

申请号：US12609142

申请日：2009-10-30

申请人： Jonathan Bnayahu ,  Edward F Nazarko ,  Mordechai Nisenson ,  Yahalomit Simionovici

发明人： Jonathan Bnayahu ,  Edward F Nazarko ,  Mordechai Nisenson ,  Yahalomit Simionovici

IPC分类号： G06F9/45 ,  G06F9/44 ,  G06Q10/00

CPC分类号： G06F8/74 ,  G06F8/34 ,  G06F8/433 ,  G06F9/45516

摘要： A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benefit action.

摘要翻译： 一种方法，包括：获得可用于处理保险索赔的计算机代码; 通过识别代码中的决策和动作来构建代表代码的控制流的计算机可读有向图，该图包括由边缘连接的节点，一些节点是与决策相关联的决策节点，并且一些节点是动作节点 与行动有关; 在图上确定每个与指定的保险索赔的至少一个货币结果相关联的行动节点的受益; 通过从每个受益动作节点向后遍历图来识别导致每个受益动作节点的所有逻辑路径，每个逻辑路径包括由边缘连接的先前决策节点和动作节点的序列，每组路径与指定的益处动作相关联 代表利益规则的节点; 并通过向与指定的利益行动相关的分组逻辑路径呈现每个指定的利益行动来输出所有利益规则。