METHOD AND KNOWLEDGE STRUCTURES FOR REASONING ABOUT CONCEPTS, RELATIONS, AND RULES
    1.
    发明申请
    METHOD AND KNOWLEDGE STRUCTURES FOR REASONING ABOUT CONCEPTS, RELATIONS, AND RULES 有权
    关于概念,关系和规则的方法和知识结构

    公开(公告)号:US20090055342A1

    公开(公告)日:2009-02-26

    申请号:US12261541

    申请日:2008-10-30

    IPC分类号: G06N5/02 G06F15/16

    CPC分类号: G06N5/04 Y10S707/99935

    摘要: A system and method for reasoning about concepts, relations and rules having a semantic network comprising at least one node from a predetermined set of node types, at least one link from a predetermined set of link types, and zero or more rules from a predetermined set of rule types, a subset of the rule types being matching rule types, each node and each link being associated with a set of zero or more rules; a network reasoning data structure having a reasoning type database having at least one regular expression, each of the regular expressions being a class of sequences having at least three node types and two link types, wherein the network reasoning data structure further has a context being a set of rules; and a reasoning engine having an activator for activating one or more activated paths in the semantic network, the set of activated paths having a common starting node in the semantic network, wherein the reasoning engine further has a validator for selecting a subset of the activated paths being valid paths, each rule from the set of rule matching types that is associated with one or more path elements on each valid path being matched by one or more rules in the context and wherein the reasoning engine further has a legal inferencer for selecting a subset of the set of valid paths being legal and valid paths, the legal and valid paths matching at least one of the regular expressions.

    摘要翻译: 一种用于推理具有语义网络的概念,关系和规则的系统和方法,所述概念,关系和规则包括来自预定的一组节点类型的至少一个节点,来自预定的一组链路类型的至少一个链路以及来自预定集合的零个或多个规则 规则类型的一部分,规则类型的一部分是匹配规则类型,每个节点和每个链接与一组零个或多个规则相关联; 具有至少一个正则表达式的推理类型数据库的网络推理数据结构,每个正则表达式是具有至少三种节点类型和两种链接类型的序列类别,其中所述网络推理数据结构还具有上下文为 一套规则; 以及具有用于激活所述语义网络中的一个或多个激活路径的激活器的推理引擎,所述激活路径集合具有所述语义网络中的公共起始节点,其中所述推理引擎还具有用于选择所述激活路径的子集的验证器 作为有效路径,来自与在上下文中的一个或多个规则匹配的每个有效路径上的一个或多个路径元素相关联的规则匹配类型的集合中的每个规则,并且其中所述推理引擎还具有用于选择子集的合法参考 的有效路径集合是合法且有效的路径,合法和有效路径与至少一个正则表达式匹配。

    Method and knowledge structures for reasoning about concepts, relations, and rules
    2.
    发明授权
    Method and knowledge structures for reasoning about concepts, relations, and rules 有权
    关于概念,关系和规则推理的方法和知识结构

    公开(公告)号:US07447667B2

    公开(公告)日:2008-11-04

    申请号:US10316588

    申请日:2002-12-11

    IPC分类号: G06N5/00

    CPC分类号: G06N5/04 Y10S707/99935

    摘要: A system and method for reasoning about concepts, relations and rules having a semantic network comprising at least one node from a predetermined set of node types, at least one link from a predetermined set of link types, and zero or more rules from a predetermined set of rule types, a subset of the rule types being matching rule types, each node and each link being associated with a set of zero or more rules; a network reasoning data structure having a reasoning type database having at least one regular expression, each of the regular expressions being a class of sequences having at least three node types and two link types, wherein the network reasoning data structure further has a context being a set of rules; and a reasoning engine having an activator for activating one or more activated paths in the semantic network, the set of activated paths having a common starting node in the semantic network, wherein the reasoning engine further has a validator for selecting a subset of the activated paths being valid paths, each rule from the set of rule matching types that is associated with one or more path elements on each valid path being matched by one or more rules in the context and wherein the reasoning engine further has a legal inferencer for selecting a subset of the set of valid paths being legal and valid paths, the legal and valid paths matching at least one of the regular expressions.

    摘要翻译: 一种用于推理具有语义网络的概念,关系和规则的系统和方法,所述概念,关系和规则包括来自预定的一组节点类型的至少一个节点,来自预定的一组链路类型的至少一个链路以及来自预定集合的零个或多个规则 规则类型的一部分,规则类型的一部分是匹配规则类型,每个节点和每个链接与一组零个或多个规则相关联; 具有至少一个正则表达式的推理类型数据库的网络推理数据结构,每个正则表达式是具有至少三种节点类型和两种链接类型的序列类别,其中所述网络推理数据结构还具有上下文为 一套规则; 以及具有用于激活所述语义网络中的一个或多个激活路径的激活器的推理引擎,所述激活路径集合具有所述语义网络中的公共起始节点,其中所述推理引擎还具有用于选择所述激活路径的子集的验证器 作为有效路径,来自与在上下文中的一个或多个规则匹配的每个有效路径上的一个或多个路径元素相关联的规则匹配类型的集合中的每个规则,并且其中所述推理引擎还具有用于选择子集的合法参考 的有效路径集合是合法且有效的路径,合法和有效路径与至少一个正则表达式匹配。

    Inferencing using disambiguated natural language rules
    3.
    发明授权
    Inferencing using disambiguated natural language rules 有权
    使用消歧的自然语言规则进行推论

    公开(公告)号:US07136807B2

    公开(公告)日:2006-11-14

    申请号:US10228122

    申请日:2002-08-26

    申请人: Erik T. Mueller

    发明人: Erik T. Mueller

    IPC分类号: G06F17/27

    CPC分类号: G06F17/2785

    摘要: A method and structure for automatically producing bridging inferences that join two related input sentences, by applying a lexicon and ontology data structure to a first input sentence to produce first input tagged sentences, applying the lexicon and ontology data structure to a second input sentence to produce second input tagged sentences, matching each first input tagged sentence to first rules, generating first inferred tagged sentences from the first rules, matching the first inferred tagged sentences to second rules, generating second inferred tagged sentences from the second rules, matching the second inferred tagged sentences to third rules, generating third inferred tagged sentences from the third rules, and so on, until a final inferred tagged sentence matches any second input tagged sentence. For each final inferred tagged sentence matching a second input tagged sentence, a bridging inference path is produced as output comprising a first input tagged sentence, a first inferred tagged sentence, a second inferred tagged sentence, a third inferred tagged sentence, and so on, and a final inferred tagged sentence. The first inferred tagged sentence in the briding inference path is the particular first inferred tagged sentence that resulted from application of a first rule to the first input tagged sentence. For the second through the last inferred tagged sentences in the bridging inference path, each inferred tagged sentence in the bridging inference path is the particular inferred tagged sentence that resulted from application of a rule to the previous inferred tagged sentence in the bridging inference path.

    摘要翻译: 一种用于通过将词典和本体数据结构应用于第一输入句子以产生第一输入标记语句来自动产生连接两个相关输入句子的桥接推理的方法和结构,将词典和本体数据结构应用于第二输入句子以产生 第二输入标记的句子,将每个第一输入标记的句子与第一规则匹配,从第一规则生成第一推断的标记语句,将第一推断的标记语句与第二规则匹配,从第二规则生成第二推断的标记语句,匹配第二推断标记 句子到第三条规则,从第三条规则生成第三个推断标记的句子,等等,直到最后推断的标记句子与任何第二个输入标记的句子相匹配。 对于与第二输入标记语句匹配的每个最终推断的标记语句,产生桥接推理路径作为包括第一输入标记语句,第一推断标记语句,第二推断标记语句,第三推断标记语句等的输出, 和最后推断标记的句子。 在推理推理路径中的第一个推断标记的句子是由第一个规则应用于第一个输入标记句子而产生的特定的第一推断标记语句。 对于桥接推理路径中的第二个到最后推断的标记句子,桥接推理路径中的每个推断标记的句子是由规则应用到桥接推理路径中的先前推断的标记句子导致的特定推断标记语句。

    Dynamically predicting patient influx into an emergency department
    5.
    发明授权
    Dynamically predicting patient influx into an emergency department 有权
    动态预测患者涌入急诊科

    公开(公告)号:US08700425B2

    公开(公告)日:2014-04-15

    申请号:US12795106

    申请日:2010-06-07

    IPC分类号: G06Q10/00 G06Q50/00

    摘要: Current patients in an emergency department of a hospital are described according to their quantity, their triage classification levels, and their wait times to calculate a current patient backlog. A sum of weight-adjusted triage classification levels of all of the current patients is calculated. Current patient arrival rates in the emergency department are tracked to calculate a current change in patient arrival rates, which are compared with historical changes in patient arrival rates. A size of an imminent influx of arriving patients into the emergency department is then predicted based on the current patient backlog, the sum of weight-adjusted triage classification levels of patients currently in the emergency department, and the current change in patient arrival rates.

    摘要翻译: 根据医院急诊科目前的患者情况,根据其数量,分类等级和等待时间来描述当前患者积压情况。 计算所有当前患者的体重调整分类水平的总和。 跟踪目前紧急部门的病人到达率,以计算患者到达率的当前变化,与患者到达率的历史变化进行比较。 然后根据目前的患者积压量,目前在急诊部门的患者的重量调整的分诊水平的总和以及患者到达率的当前变化,预测到达患者即将涌入急诊部门的大小。

    Dynamically adjusting triage classification levels
    7.
    发明授权
    Dynamically adjusting triage classification levels 失效
    动态调整分类等级

    公开(公告)号:US08352285B2

    公开(公告)日:2013-01-08

    申请号:US12797888

    申请日:2010-06-10

    IPC分类号: G06Q10/00

    CPC分类号: G06Q50/22 G06F19/00 G06Q10/06

    摘要: An initial triage level classification for a latest patient to arrive at an emergency department (ED) is received. Availability levels of resources needed to treat the latest patient are electronically collected, along with triage level classifications for all other patients currently in the ED. The initial triage level classification of the latest patient is adjusted upward or downward based on the availability levels of resources needed to treat the latest patient and based on the triage level classifications for the patients in the ED. The triage level classifications for all patients currently in the ED are summed up. If a sum of all triage level classifications exceeds a first predetermined threshold, other resources are reallocated in order to provide the resources needed to treat the latest patient to arrive at the ED. If the sum of all triage level classifications exceeds a second predetermined threshold, then a disaster plan is implemented.

    摘要翻译: 收到最近一名患者到达急诊科(ED)的初步分级水平分类。 电子收集治疗最新患者所需资源的可用性水平,以及目前在ED中所有其他患者的分类水平分类。 根据治疗最新患者所需资源的可用性水平,并根据ED患者的分类水平分类,最新患者的初步分级水平分类向上或向下调整。 总结了目前在ED中所有患者的分类水平分类。 如果所有分级等级分类的总和超过第一预定阈值,则重新分配其他资源,以便提供治疗最新患者到达ED所需的资源。 如果所有分级等级分类的总和超过第二预定阈值,则实施灾难计划。

    Method and knowledge structures for reasoning about concepts, relations, and rules
    8.
    发明授权
    Method and knowledge structures for reasoning about concepts, relations, and rules 有权
    关于概念,关系和规则推理的方法和知识结构

    公开(公告)号:US07844562B2

    公开(公告)日:2010-11-30

    申请号:US12261541

    申请日:2008-10-30

    IPC分类号: G06N5/00

    CPC分类号: G06N5/04 Y10S707/99935

    摘要: A system and method for reasoning about concepts, relations and rules having a semantic network comprising at least one node from a predetermined set of node types, at least one link from a predetermined set of link types, and zero or more rules from a predetermined set of rule types, a subset of the rule types being matching rule types, each node and each link being associated with a set of zero or more rules; a network reasoning data structure having a reasoning type database having at least one regular expression, each of the regular expressions being a class of sequences having at least three node types and two link types, wherein the network reasoning data structure further has a context being a set of rules; and a reasoning engine having an activator for activating one or more activated paths in the semantic network, the set of activated paths having a common starting node in the semantic network, wherein the reasoning engine further has a validator for selecting a subset of the activated paths being valid paths, each rule from the set of rule matching types that is associated with one or more path elements on each valid path being matched by one or more rules in the context and wherein the reasoning engine further has a legal inferencer for selecting a subset of the set of valid paths being legal and valid paths, the legal and valid paths matching at least one of the regular expressions.

    摘要翻译: 一种用于推理具有语义网络的概念,关系和规则的系统和方法,所述概念,关系和规则包括来自预定的一组节点类型的至少一个节点,来自预定的一组链路类型的至少一个链路以及来自预定集合的零个或多个规则 规则类型的一部分,规则类型的一部分是匹配规则类型,每个节点和每个链接与一组零个或多个规则相关联; 具有至少一个正则表达式的推理类型数据库的网络推理数据结构,每个正则表达式是具有至少三种节点类型和两种链接类型的序列类别,其中所述网络推理数据结构还具有上下文为 一套规则; 以及具有用于激活所述语义网络中的一个或多个激活路径的激活器的推理引擎,所述激活路径集合具有所述语义网络中的公共起始节点,其中所述推理引擎还具有用于选择所述激活路径的子集的验证器 作为有效路径,来自与在上下文中的一个或多个规则匹配的每个有效路径上的一个或多个路径元素相关联的规则匹配类型的集合中的每个规则,并且其中所述推理引擎还具有用于选择子集的合法参考 的有效路径集合是合法且有效的路径,合法和有效路径与至少一个正则表达式匹配。

    Inferencing using disambiguated natural language rules
    9.
    发明授权
    Inferencing using disambiguated natural language rules 有权
    使用消歧的自然语言规则进行推论

    公开(公告)号:US07383173B2

    公开(公告)日:2008-06-03

    申请号:US11520318

    申请日:2006-09-13

    申请人: Erik T. Mueller

    发明人: Erik T. Mueller

    IPC分类号: G06F17/27

    CPC分类号: G06F17/2785

    摘要: A method and structure for automatically producing bridging inferences that join two related input sentences, by applying a lexicon and ontology data structure to a first input sentence to produce first input tagged sentences, applying the lexicon and ontology data structure to a second input sentence to produce second input tagged sentences, matching each first input tagged sentence to first rules, generating first inferred tagged sentences from the first rules, matching the first inferred tagged sentences to second rules, generating second inferred tagged sentences from the second rules, matching the second inferred tagged sentences to third rules, generating third inferred tagged sentences from the third rules, and so on, until a final inferred tagged sentence matches any second input tagged sentence. For each final inferred tagged sentence matching a second input tagged sentence, a bridging inference path is produced as output comprising a first input tagged sentence, a first inferred tagged sentence, a second inferred tagged sentence, a third inferred tagged sentence, and so on, and a final inferred tagged sentence. The first inferred tagged sentence in the briding inference path is the particular first inferred tagged sentence that resulted from application of a first rule to the first input tagged sentence. For the second through the last inferred tagged sentences in the bridging inference path, each inferred tagged sentence in the bridging inference path is the particular inferred tagged sentence that resulted from application of a rule to the previous inferred tagged sentence in the bridging inference path.

    摘要翻译: 一种用于通过将词典和本体数据结构应用于第一输入句子来产生第一输入标记语句来自动产生连接两个相关输入句子的桥接推断的方法和结构,将词典和本体数据结构应用于第二输入句子以产生 第二输入标记的句子,将每个第一输入标记的句子与第一规则匹配,从第一规则生成第一推断的标记语句,将第一推断的标记语句与第二规则匹配,从第二规则生成第二推断的标记语句,匹配第二推断标记 句子到第三条规则,从第三条规则生成第三个推断标记的句子,等等,直到最后推断的标记句子与任何第二个输入标记的句子相匹配。 对于与第二输入标记语句匹配的每个最终推断的标记语句,产生桥接推理路径作为包括第一输入标记语句,第一推断标记语句,第二推断标记语句,第三推断标记语句等的输出, 和最后推断标记的句子。 在推理推理路径中的第一个推断标记的句子是由第一个规则应用于第一个输入标记句子而产生的特定的第一推断标记语句。 对于桥接推理路径中的第二个到最后推断的标记句子,桥接推理路径中的每个推断标记的句子是由规则应用到桥接推理路径中的先前推断的标记句子导致的特定推断标记语句。

    DYNAMICALLY ADJUSTING TRIAGE CLASSIFICATION LEVELS
    10.
    发明申请
    DYNAMICALLY ADJUSTING TRIAGE CLASSIFICATION LEVELS 失效
    动态调整TRIAGE分类级别

    公开(公告)号:US20110307264A1

    公开(公告)日:2011-12-15

    申请号:US12797888

    申请日:2010-06-10

    IPC分类号: G06Q50/00 G06Q10/00

    CPC分类号: G06Q50/22 G06F19/00 G06Q10/06

    摘要: An initial triage level classification for a latest patient to arrive at an emergency department (ED) is received. Availability levels of resources needed to treat the latest patient are electronically collected, along with triage level classifications for all other patients currently in the ED. The initial triage level classification of the latest patient is adjusted upward or downward based on the availability levels of resources needed to treat the latest patient and based on the triage level classifications for the patients in the ED. The triage level classifications for all patients currently in the ED are summed up. If a sum of all triage level classifications exceeds a first predetermined threshold, other resources are reallocated in order to provide the resources needed to treat the latest patient to arrive at the ED. If the sum of all triage level classifications exceeds a second predetermined threshold, then a disaster plan is implemented.

    摘要翻译: 收到最近一名患者到达急诊科(ED)的初步分级水平分类。 电子收集治疗最新患者所需资源的可用性水平,以及目前在ED中所有其他患者的分类水平分类。 根据治疗最新患者所需资源的可用性水平,并根据ED患者的分类水平分类,最新患者的初步分级水平分类向上或向下调整。 总结了目前在ED中所有患者的分类水平分类。 如果所有分级等级分类的总和超过第一预定阈值,则重新分配其他资源,以便提供治疗最新患者到达ED所需的资源。 如果所有分级等级分类的总和超过第二预定阈值,则实施灾难计划。