Patent Document ID: 20150066476
Application ID: 14016538
Patent Status: 0

Claim One:
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 dynamic two bit vector 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, 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 ̂ F T U D 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); h) using the use of a phrase structure rewrite rule associated with a node within the semantic network for the testing and passing of the rewrite rule; i) implementing a top/down bottom/up parser capable of a plurality of syntactic parses of a grammar; j) using the symbols comprise {S} for start, {Np} for noun phrase, {Vp} for verb phrase and {Pp} for prepositional phrase (predicate participant) for natural language processing; and k) using terminal symbols comprising {N} for noun, {V} for verb, {det} for determinant and {prep} for preposition.