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

Boolean satisfiability problem solving method and system

A technique for Boolean satisfiability and problem solving, which is applied in the field of Boolean satisfiability problem solving methods and systems, and can solve problems such as time limitation and space limitation

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

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to solve the technical problem that the SAT solver of the prior art randomly selects the first branch variable to cause time and space limitations in the initial stage of the solution. The present invention proposes a solution to the Boolean satisfiability problem method and system

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
  • Boolean satisfiability problem solving method and system
  • Boolean satisfiability problem solving method and system
  • Boolean satisfiability problem solving method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] In the present invention, a method for solving the Boolean satisfiability problem is provided, which includes: using multiple parallel solvers to solve the CNF instance in parallel within a set threshold condition, wherein each parallel solver uses a different Each parallel solver stops solving after the threshold condition is triggered, and records the activity scores of each variable during the solution process; select the variable with the highest sum of activity scores obtained by the multiple parallel solvers as the main variable The initial argument of the solver to solve the CNF instance.

[0032] Specifically, such as figure 1 As shown, the method for solving the Boolean satisfiability problem includes steps S1-S6. Each will be described below.

[0033] S1: Initialize the main solver.

[0034] In the embodiment of the present invention, the main solver adopts a SAT solver with CDCL as an algorithm framework and a branch heuristic test strategy, clause learnin...

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 Boolean satisfiability problem solving method and system, and the method comprises the steps: employing a plurality of parallel solvers to carry out the multi-thread parallelsolving of a CNF instance in a set threshold condition, and enabling each parallel solver to employ different initial variables; each parallel solver stops solving after triggering a threshold condition, and records the activity score of each variable in the solving process; and selecting a variable element with the highest sum of the active fractions obtained by the plurality of parallel solversas an initial variable element of a main solver, and solving the CNF instance. By adopting the technical scheme of the invention, the solving speed of the Boolean satisfiability problem can be improved.

Description

technical field [0001] The present invention relates to the field of electronic design automation (Electronic Design Automation, EDA), in particular to a Boolean satisfiability problem solving method and system. Background technique [0002] The satisfiability problem (SAT problem) refers to giving a propositional logic formula expressed in the conjunction paradigm format, reasoning and judging whether there is one or more sets of assignments that make the formula expressed in the conjunction paradigm satisfiable. In the satisfiable case, the algorithm will give a set of solutions that make the problem satisfiable. From 2002 to 2020, a large number of efficient SAT solvers and advanced algorithms have been continuously proposed. The algorithms are mainly divided into two types, namely CDCL (conflict driven clause learning) algorithm and SLS (stochastic local search , random local search) algorithm. The CDCL algorithm is based on the improvement of the DPLL algorithm. It an...

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/32
CPCG06F30/32
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