Logical Determination Table for BDD Statement Evaluation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determining logical formulas using binary decision diagrams (BDDs) often require evaluating most statements, leading to speed degradation and inefficiency, especially when determining whether a logical formula is satisfied based on varying determination target data and potential errors in data readout.
Innovation Solution
The method generates a logical determination table that identifies relationships among statements, allowing for early termination of the determination process if any statement group within a logical disjunction or conjunction is not satisfied, thereby reducing the number of statements that need to be evaluated.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a BDD is used to determine a logical formula by evaluating statements in a defined order, then the determination process is systematic and complete, but the time required for determination increases when most statements must be evaluated
Solution Approach 1:
The patent performs preliminary analysis to generate a logical determination table that identifies relationships among statements and determines evaluation priorities before actual determination. This preliminary structuring allows the system to evaluate only necessary statements in optimal order, avoiding unnecessary evaluations and reducing determination time while maintaining accuracy
Solution Approach 2:
The patent segments the logical formula into multiple statement groups and creates a logical determination table that organizes these segments with their evaluation priorities. By dividing the determination process into hierarchical segments with clear evaluation paths, the system can terminate early when unsatisfied groups are identified, reducing overall determination time
2Reliability
If all statements in a logical formula are evaluated to ensure accurate determination, then determination accuracy is maintained, but the complexity of the determination process increases
Solution Approach 1:
The system performs preliminary analysis to generate a logical determination table that pre-establishes evaluation paths and relationships among statements. This preliminary structuring simplifies the actual determination process by providing a clear hierarchical framework, reducing process complexity while ensuring all necessary evaluations are performed for accuracy
Solution Approach 2:
The patent introduces a logical determination table as an intermediary structure between the logical formula and the evaluation process. This table serves as a mediator that organizes statements into hierarchical groups with defined evaluation priorities, simplifying the determination process while maintaining comprehensive evaluation coverage
3Ease of manufacture
If the determination process evaluates statements in a fixed order using BDD, then the process is straightforward to implement, but efficiency decreases when early termination is not possible
Solution Approach 1:
The patent performs preliminary analysis to generate a logical determination table that establishes optimal evaluation paths before actual determination. This preliminary structuring enables early termination when unsatisfied statement groups are identified, dramatically improving efficiency while maintaining implementation simplicity through systematic organization
Solution Approach 2:
The patent transforms the fixed evaluation order of traditional BDD into a dynamic evaluation process guided by the logical determination table. The table enables adaptive termination based on intermediate results, allowing the system to skip unnecessary evaluations and improve efficiency while keeping the implementation approach straightforward
Data Source
AI summary
A determination method includes: generating, when a logical formula is received, another statement group that shares either one of individual statements and one or plural statements of statement groups with each of the individual statements and statement groups that are included in the logical formula or a changed logical formula acquired with the performance of logically equivalent conversion with regard to the logical formula, the logical formula or the changed logical formula including a logical disjunction of the individual statements or the statement groups that are logical conjunctions of the one or plural statements; and performing a determination process of the logical formula, wherein the logical formula is determined as not satisfied when a determination result indicating that the statements that are included in the other statement group are not satisfied is obtained in the determination process.