Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Branch heuristic calculation optimization method, SAT solver and storage medium

An optimization method and branching technology, applied in computing, instrumentation, electrical and digital data processing, etc., can solve problems such as insufficient optimization of branch-inspired calculation, and achieve the advantages of shortened solution time, good solution effect, and reduced number of conflicts and propagation. Effect

Pending Publication Date: 2022-01-11
深圳国微福芯技术有限公司
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] In order to solve the technical problem that the branch heuristic calculation process is not optimized enough in the prior art, the present invention proposes an optimization method for branch heuristic calculation, a SAT solver, and a storage medium

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 calculation optimization method, SAT solver and storage medium
  • Branch heuristic calculation optimization method, SAT solver and storage medium
  • Branch heuristic calculation optimization method, SAT solver and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0030] 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 oth...

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 calculation optimization method, an SAT solver and a storage medium. The branch heuristic calculation optimization method comprises the following steps: when a conjunctive normal form instance is preprocessed, performing cyclic simplification on the conjunctive normal form instance until a single-character clause does not exist in the conjunctive normal form instance; and in the process of calculating the pre-processed conjunctive normal form instance by adopting a branch heuristic algorithm, when the variable activity is calculated after each conflict occurs, adding the length of the clause with the current conflict into the calculation of the variable activity so as to realize the preferential solution of the long clause. According to the method, branch heuristic calculation is optimized in multiple aspects, and the resolving speed of the SAT resolver is increased.

Description

technical field [0001] The invention relates to the technical field of Boolean satisfiability verification, in particular to an optimization method for branch heuristic calculation. Background technique [0002] Early preprocessing techniques used the unit propagation and literal rules proposed by the original DPLL (Davis-Putnam-Logemann-Loveland), and later developed some more complex techniques such as super binary parsing, unit clauses and probes, etc. In recent years, a large number of excellent results have appeared in preprocessing technology, such as preprocessing pruning technology, setting technology for unconstrained areas with consistency boundaries, and using symmetric and extensible unary clause propagation to get more unit clauses. The variable elimination algorithm of the dynamic constraint of the text length, and the method of dividing the Boolean formula into clause groups to judge the Boolean satisfiability, etc. [0003] There is a balance between reducti...

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/205G06F40/279
CPCG06F40/205G06F40/279
Inventor 李鹏飞刘美华张岩黄国勇
Owner 深圳国微福芯技术有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com