利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

97 条记录 (耗时 0.034 秒)

    RULES BASED DATA PROCESSING SYSTEM AND METHOD
    4.
    发明申请
    RULES BASED DATA PROCESSING SYSTEM AND METHOD 审中-公开

    公开(公告)号：US20150310341A1

    公开(公告)日：2015-10-29

    申请号：US14736164

    申请日：2015-06-10

    申请人： VIDITECK AG

    发明人： Björn DANIELSSON

    IPC分类号： G06N5/04

    CPC分类号： G06F16/334 ,  G06F8/313 ,  G06F9/445 ,  G06F16/2365 ,  G06F16/332 ,  G06F16/93 ,  G06N5/046 ,  H04L67/10

    摘要： Systems, methods and mediums are described for processing rules and associated bags of facts generated by an application in communication with a processing engine, database and rule engine that process the bags of facts in view of the rules and generate one or more rule-dependent responses to the application which performs one or more work flows based on the responses. The rule engine may apply forward-chaining, backward-chaining or a combination of forward-chaining and backward-chaining to process the rules and facts. Numerous novel applications that work in conjunction with the processing engine, database and rule engine are also described.

    Precondition generating apparatus
    5.
    发明授权
    Precondition generating apparatus 失效
    前提条件生成装置

    公开(公告)号：US08707273B2

    公开(公告)日：2014-04-22

    申请号：US13453006

    申请日：2012-04-23

    申请人： Takeo Imai ,  Masahiro Sakai

    发明人： Takeo Imai ,  Masahiro Sakai

    IPC分类号： G06F9/44

    CPC分类号： G06F8/313 ,  G06F11/3608

    摘要： There is provided a precondition generating apparatus in which a storage stores a set “S” of logical expressions; a creating unit creates a first logical expression being a logical product of the “S”, logical expressions of a program and a negation of a logical expression indicating a postcondition; a solver finds a solution that makes the first logical expression true and specifies a set of clauses that cannot be simultaneously true in the first logical expression if not found; wherein the creating unit sets relaxing variables for the logical expressions belonging to the set “S” in the set of clauses wherein the logical expressions indicates a precondition of the program, generates a second logical expression by alleviating the clauses of logical expressions corresponding to the relaxing variables in the first logical expression, and applies same process as in the first logical expression to the second logical expression.

    摘要翻译： 提供了一种前提条件生成装置，其中存储器存储逻辑表达式的集合“S” 创建单元创建第一逻辑表达式，其是“S”，程序的逻辑表达式和指示后置条件的逻辑表达式的否定的逻辑积; 求解器找到一个使第一个逻辑表达式为真的解决方案，并指定一组在第一个逻辑表达式中不能同时为true的子句; 其特征在于，所述创建单元为所述组合中的所述组合“S”设置用于所述逻辑表达式的松弛变量，其中所述逻辑表达式表示所述程序的前提，通过减轻对应​​于所述放松的逻辑表达式的子句来生成第二逻辑表达式 第一个逻辑表达式中的变量，并将第一个逻辑表达式中的相同过程应用于第二个逻辑表达式。

    AVAILABLE SYMBOL SET GENERATION USING UNTYPED VARIABLE
    6.
    发明申请
    AVAILABLE SYMBOL SET GENERATION USING UNTYPED VARIABLE 有权
    可用符号设置生成使用不可变的

    公开(公告)号：US20130159967A1

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

    申请号：US13329136

    申请日：2011-12-16

    申请人： Charles P. Jazdzewski ,  Michael C. Fanning

    发明人： Charles P. Jazdzewski ,  Michael C. Fanning

    IPC分类号： G06F9/44

    CPC分类号： G06F8/41 ,  G06F8/313

    摘要： The facilitated computation of an available symbol set at code locations in a dynamic language program, in which the program is executed up to a particular halt point for which an available symbol set is to be generated. At the halt point, a type of a value of a particular variable may be used in order to generate the available symbol set. However, at the halt point, the variable does not yet have a value of a useful type (e.g., null or undefined), which is possible in a dynamic language program. Rather than return an error, the principles described herein returns an arbitrary symbol set anyway. Specifically, the variable had previously been annotated with information represented accessed type information for the variable, even though the variable has not formally been defined. This annotated information may be used to generate the available symbol set.

    摘要翻译： 在动态语言程序中的代码位置处的可用符号集合的便利计算，其中程序被执行到要生成可用符号集的特定停止点。 在停止点，可以使用特定变量的值的类型以便生成可用符号集。 然而，在停止点，该变量尚未具有有用类型（例如，空或未定义）的值，这在动态语言程序中是可能的。 不是返回错误，而是在这里所述的原理返回任意的符号集。 具体来说，尽管变量尚未被正式定义，但变量之前已经用变量的已访问信息表示访问类型信息。 该注释信息可用于生成可用符号集。

    PROCESSING PREDICATES INCLUDING POINTER INFORMATION
    7.
    发明申请
    PROCESSING PREDICATES INCLUDING POINTER INFORMATION 有权
    处理预测包括指针信息

    公开(公告)号：US20110161937A1

    公开(公告)日：2011-06-30

    申请号：US12649335

    申请日：2009-12-30

    申请人： Eleonora O. Bounimova ,  Vladimir A. Levin ,  Leonardo M. de Moura ,  Thomas J. Ball

    发明人： Eleonora O. Bounimova ,  Vladimir A. Levin ,  Leonardo M. de Moura ,  Thomas J. Ball

    IPC分类号： G06F9/44

    CPC分类号： G06F8/313 ,  G06F8/434 ,  G06F11/3608

    摘要： A system is described for processing predicates in the course of analyzing a program, based on a general-purpose theory of pointers. The system converts location expressions in the predicates into logical formulae that are interpretable by a theorem prover module, producing converted predicates. This conversion associates the location expressions with location objects. More specifically, the conversion represents variables as explicitly-specified location objects, and location terms (such as a field-type access terms and dereference-type terms) as constructor-specified location objects. The theory of pointers is also expressed by a set of axioms which constrain the operation of the theorem prover module.

    摘要翻译： 描述了一种基于指针的通用理论在分析程序过程中处理谓词的系统。 系统将谓词中的位置表达式转换为可由定理证明器模块解释的逻辑公式，从而产生转换的谓词。 此转换将位置表达式与位置对象相关联。 更具体地说，转换表示作为显式指定的位置对象的变量，以及作为构造器指定的位置对象的位置术语（诸如字段类型访问术语和解引用类型术语）。 指针理论也由限定定理证明器模块操作的一组公理表示。

    System for processing data using logic language
    9.
    发明授权
    System for processing data using logic language 失效
    使用逻辑语言处理数据的系统

    公开(公告)号：US5129081A

    公开(公告)日：1992-07-07

    申请号：US579249

    申请日：1990-09-06

    申请人： Kenzo Kobayashi ,  Michio Sasaki

    发明人： Kenzo Kobayashi ,  Michio Sasaki

    IPC分类号： G06F9/44

    CPC分类号： G06F8/313 ,  Y10S707/99931 ,  Y10S707/99953

    摘要： A logical type language data processing method which includes making a plurality of different application programs each using a predicate type fact database and/or a predicate type rule database; inputting a predicate type question with respect to the application programs to process data by unification and back tracking processes; making and storing a common predicate type fact database which is used commonly by the different application programs; putting a symbol to predicates of the different application programs to indicate that the predicates with the symbol are common type predicates which should use the common predicate type fact database; and accessing the common predicate type fact database if any of the predicates with the symbols is read out during execution of the application programs.

    摘要翻译： 一种逻辑类型语言数据处理方法，其包括使用谓词类型事实数据库和/或谓词类型规则数据库来制作多个不同的应用程序; 输入关于应用程序的谓词类型问题，以通过统一和返回跟踪过程来处理数据; 制作和存储由不同应用程序共同使用的公共谓词类型事实数据库; 将符号放在不同应用程序的谓词上，以指示具有符号的谓词是应使用公共谓词类型事实数据库的常见类型谓词; 并且如果在执行应用程序期间读出具有符号的任何谓词，则访问公共谓词类型事实数据库。

    Multiprocessor system and a method of load balancing thereof
    10.
    发明授权
    Multiprocessor system and a method of load balancing thereof 失效
    多处理器系统及其负载平衡方法

    公开(公告)号：US5053950A

    公开(公告)日：1991-10-01

    申请号：US522504

    申请日：1990-05-11

    申请人： Jiro Naganuma ,  Takeshi Ogura

    发明人： Jiro Naganuma ,  Takeshi Ogura

    IPC分类号： G06F9/44 ,  G06F9/50

    CPC分类号： G06F9/5083 ,  G06F8/313

    摘要： A multiprocessor system has a plurality of processors and a network system linking said processors to thereby process a given computational load written in a logic programming language. According to an initial load balancing algorithm, each processor independently and dynamically selects an initial load segment thereof from the given load by use of system information representative of characteristics of the multiprocessor system without transferring information between the processors, whereby an initial load balancing is obtained in the multiprocessor system. According to a load balancing algorithm for reproducing working environments, which algorithm is performed after performing the initial load balancing algorithm, a partial load segment of a first processor is shared with a second processor. In this case, the first processor generates history information representative of the working environment thereof, but the amount of the history information is smaller than that of the whole working environment of the first processor. This history information is supplied to the second processor wherein the working environment of the first processor is reproduced by use of the history information. Thereafter, the second processor processes the partial load segment of the first processor by use of the reproduced working environment of the first processor, while the first processor processes the load segment thereof. Thus, the present multiprocessor system can greatly reduce the amount of the information over that of a conventional multiprocessor system, whereby the load balancing can be performed at high speed.

    摘要翻译： 多处理器系统具有多个处理器和连接所述处理器从而处理以逻辑编程语言编写的给定计算负载的网络系统。 根据初始负载均衡算法，每个处理器通过使用表示多处理器系统的特性的系统信息独立且动态地从给定负载中选择其初始负载段，而不在处理器之间传送信息，从而获得初始负载平衡 多处理器系统。 根据用于再现工作环境的负载平衡算法，在执行初始负载平衡算法之后执行哪种算法，第一处理器的部分负载段与第二处理器共享。 在这种情况下，第一处理器生成表示其工作环境的历史信息，但是历史信息的数量小于第一处理器的整个工作环境的历史信息量。 该历史信息被提供给第二处理器，其中通过使用历史信息再现第一处理器的工作环境。 此后，第二处理器通过使用第一处理器的再现工作环境来处理第一处理器的部分负载段，而第一处理器处理其负载段。 因此，本发明的多处理器系统可以大大减少与常规多处理器系统相比的信息量，从而可以高速执行负载均衡。