Patent ID: 9575951
Date: 2017-02-21
CPC Classifications: G06F,G06N

Claim:
1. A machine implemented method of executing four-valued logic in a semantic network, the method comprising: defining a logic system having a NOT logical connective denoted as “ F T U D FvF is F, FvT is T, FvU is U, FvD is D; TvF is T, TvT is T, TvU is T, TvD is T; UvF is U, UvT is T, UvU is U, UvD is T; and DvF is D, DvT is T, DvU is T, DvD is D; generating a semantic network representing digitally stored information, said semantic network comprising a plurality of object nodes and a plurality of relationships between said plurality of object nodes, by: testing conditionals or quantifying variables in said semantic network during successive recursive steps in a predicate calculus using said logic system, the false values, true values, undefined values, and defined values in the semantic information associated with said plurality of object nodes, and the syntactic information associated with said plurality of relationships, and a phrase structure rewrite rule on said plurality of object node; and using a top/down, bottom/up parser to syntactically parse grammar within said semantic network, by marking subsets of said plurality of object nodes as {S} for start, {Np} for a noun phrase, {Vp} for verb a phrase and {Pp} for a prepositional phrase (predicate participant), and marking each of said plurality of object nodes as {N} for a noun, {V} for a verb, {det} for a determinant and {prep} for a preposition, wherein linear encoding of said semantic information and said syntactic information optimizes short term memory, maximizes long term storage, and optimizes communication and memory between different knowledge sources or processes.