Variable element assignment sequence, assignment optimization algorithm and Boolean satisfiability verification algorithm

A technology of Boolean satisfiability and sequential optimization, applied in design optimization/simulation, calculation, special data processing applications, etc., can solve problems such as low calculation efficiency

Pending Publication Date: 2021-04-30
SHENZHEN STATE MICRO TECH CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] In order to solve the technical problem of low calculation efficiency caused by random selection of variables for assignment in the prior art, the present invention proposes an assignment order of variables, an assignment optimization algorithm, and a Boolean satisfiability verification algorithm

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
  • Variable element assignment sequence, assignment optimization algorithm and Boolean satisfiability verification algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] 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.

[0049] 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 other...

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 variable element assignment sequence and assignment optimization algorithm and a Boolean satisfiability verification algorithm. According to the assignment sequence optimization algorithm for the branch heuristic variables, at least one variable determines an assignment sequence by adopting the following steps: taking a current variable to be assigned as a current variable; searching for associated variables appearing in the same clause with the current variable at the same time; accumulating the number of times that the associated variable and the current variable appear in the same clause at the same time; and selecting the associated variable with the least number of times as a to-be-assigned variable after the current variable. 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 order optimization algorithm, a branch-inspired variable assignment optimization algorithm, and a Boolean algorithm using the assignment optimization algorithm. Satisfiability verification 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] In the Boolean satisfiability verification process, BCP propagation takes up most of the time. A good branch heuristic strategy can quickly find decision variables, reduce the number of conflicts, and speed up the BCP process. The operational efficiency of a satisfaction verification tool is significant. Currently, the VSIDS branch heuristic strategy is...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F30/20G06F11/36
CPCG06F11/3684G06F11/3692G06F30/20
Inventor 刘美华屈璋张岩黄国勇金玉丰
Owner SHENZHEN STATE MICRO TECH CO LTD
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