Four-Valued Logic Encoding for Computational Efficiency

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing logic systems and truth tables lack efficiency in data testing, manipulation, and analysis, particularly in computer architectures, due to inefficiencies in encoding syntactic and semantic information and recursive predicate analysis.

Innovation Solution

A two-bit vector notation is used to encode both syntactic and semantic information within a semantic network, allowing for efficient encoding of properties in recursive predicate analysis and optimizing short-term memory while maximizing long-term storage through linear scaling, using symbols (F, T, U, D) to represent values and defining binary connectives for logical operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional logic systems and truth tables are used for data testing and analysis, then the system can perform logical operations, but the computational time and processing costs increase significantly

Engineering Contradiction:
Improvecomputational efficiencyVSAvoidcomputational time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent segments the evaluation of conditional expressions into distinct phases: syntactic evaluation and semantic evaluation. This segmentation allows the system to process different aspects of logical expressions separately and efficiently, avoiding the need to evaluate entire complex expressions through traditional truth tables, thereby reducing computational time and improving processing productivity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a four-valued logic system that adds semantic dimension (defined/undefined) to the traditional binary logical dimension (true/false). This dimensional expansion allows for more nuanced representation of information states, enabling the system to handle incomplete or partially evaluated expressions more efficiently without requiring exhaustive truth table computations.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Quantity of substance

If traditional encoding methods are used for syntactic and semantic information, then the system can store data, but memory efficiency decreases and storage costs increase

Engineering Contradiction:
Improvememory usageVSAvoidencoding complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent merges syntactic and semantic information into a unified four-valued logic framework. By combining the evaluation of syntactic properties (true/false) with semantic properties (defined/undefined) into a single integrated system, the patent reduces the overall memory requirements compared to maintaining separate encoding schemes, while the standardized four-valued framework actually simplifies the encoding complexity.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The four-valued logic system serves multiple functions simultaneously: it represents truth values, tracks definition status, manages conditional evaluation states, and enables efficient memory representation. This multi-functionality allows a single encoding mechanism to handle various aspects of data representation, reducing both memory usage and encoding complexity compared to specialized separate systems.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS9576244B2Methods and systems of four-valued simulation
Publication Date: 2017.02.21 MIDMORE ROGER
  • US9576244B2 patent drawing
  • US9576244B2 patent drawing
  • US9576244B2 patent drawing

AI summary

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.