发明名称 Methods and Systems of Four-Valued Simulation
摘要 A system for the dynamic encoding in a semantic network of both syntactic and semantic information into a common four valued logical notation. The encoding of new information being benign to prior syntactic constructions, tests for N conditionals in time O(C) and allows for the proper quantification of variables at each recursive step. The query/inference engine constructed from such an implementation is able to optimize short term memory for maximizing long term storage in the automaton. In a parallel context this can be viewed as optimizing communication and memory allocation between processes. Disclosed embodiments of a four valued encoding achieve efficiencies in minimizing the run time stack and maximizing heap size especially in a parallel architecture. Disclosed embodiments are useful in simulation and search engine implementations.
申请公布号 US2015066836(A1) 申请公布日期 2015.03.05
申请号 US201314016518 申请日期 2013.09.03
申请人 Midmore Roger 发明人 Midmore Roger
分类号 G06F17/30;G06N5/04 主分类号 G06F17/30
代理机构 代理人
主权项 1. A machine implemented method of executing a four-valued logic to optimize short term memory and to maximize long term storage, the method comprising: a) using symbols comprising (F, T, U, D) to represent the values false, true, undefined, and defined, mapped into a two vector dynamic array; the values further mapped into indexes within the two vector dynamic arrays and stored as nodes within a semantic network; b) for F, T, U, D, defined into set theory, such as { } for undefined, {T} for true, {F} for false, { } for undefined and {T, F} for defined, these values are interpreted as properties {P} for T and, {P} false, { } for undefined and {P, P} for defined, which are the properties used for testing the conditionals and quantifying variables for successive recursive steps in the predicate calculus; c) defining a logic with a negation, ignoring monotonic argumentations, with the following binary connectives: for the logical AND (̂), NOT (); and logical OR (V) connectives as follows used to prove the completeness of the logics: F is T T is F U is D D is U; d) for the ̂ connective ̂ A FTUD F F F F F T F T U D U F U U F D F D F D; e) for the V connective V F T U D F F T U D T T T T T U U T U T D D T T D; f) optimizing short term memory maximizing long term storage by the linear encoding of syntactic and semantic information into the semantic network; g) in a parallel context optimizing short term memory to maximize long term storage becomes optimizing communication and memory between different knowledge sources (processes).
地址 San Francisco CA US