Branch heuristic variable element assignment optimization algorithm and Boolean satisfiability verification algorithm

A technology of Boolean satisfiability and optimization algorithm, which is applied in computing, instrumentation, electrical digital data processing, etc., and can solve problems such as low computing efficiency

Pending Publication Date: 2021-04-13
深圳国微芯科技有限公司
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] In order to solve the technical problem of low computational efficiency caused by assigning values ​​to variables in the prior art, th

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Branch heuristic variable element assignment optimization algorithm and Boolean satisfiability verification algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0050] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0051]Thus, a feature indicated in this specification will be used to describe one of the features of an embodiment of the present invention, rather than implying that every embodiment of the present invention must have the described feature. Furthermore, it should be noted that this specification describes a number of features. Although certain features may be combined to illustrate possible system designs, these features may also be used in other combinations not explicitly described. Thus, the illustrated combinations are not intended to be limiting unless othe...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a branch heuristic variable element assignment optimization algorithm and a Boolean satisfiability verification algorithm. According to the assignment optimization algorithm for the branch heuristic variables, at least one variable is assigned by adopting the following assignment steps: carrying out first assignment on a variable to be assigned; calculating a first time when the variable element to be assigned has n conflicts in branch heuristics after assignment; negating the value of the first assignment and carrying out second assignment on the variable to be assigned by using the negated value; calculating second time of n conflicts of the variables to be assigned in branch heuristics after assignment; and comparing the first time with the second time, and selecting the value of the assignment with the short time to assign the variable to be assigned. According to the invention, the calculation time of the branch heuristic algorithm can be shortened.

Description

technical field [0001] The invention relates to the technical field of Boolean satisfiability verification in equivalence verification tools, in particular to a branch-inspired variable assignment optimization algorithm and a Boolean satisfiability verification algorithm using the assignment optimization algorithm. Background technique [0002] Boolean satisfiability verification algorithms usually contain three main parts: branch heuristic algorithm, deductive mechanism and BCP (ie, BCP propagation), and conflict analysis and learning. [0003] Among them, the branching heuristic algorithm is to select a series of decision variables to identify a fast-satisfying task. There are three typical branching heuristic algorithms as follows. [0004] The first, random assignment (RAND), uses a simple decision heuristic to randomly select the next decision variable from unassigned variables. Based on the maximum number of clauses or senses, the routine selects a decision variable. ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F40/226G06F40/211
CPCG06F40/211G06F40/226
Inventor 刘美华毕舜阳张岩黄国勇金玉丰
Owner 深圳国微芯科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap