Method for solving Boolean satisfiability problem based on extension rule

A satisfiability and problem-solving technology, applied in the field of Boolean satisfiability problem solving, can solve problems that affect the efficiency of ERACC algorithm solution

Pending Publication Date: 2020-01-14
GUANGXI NORMAL UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, when the ERACC algorithm avoids falling into local optimum, it uses CC ER Inspired Strategies, the CC ER The principle of inspiration is that if a variable has not changed its pattern since the last flip, flipping is prohibited, even if its flipping can bring many benefits, which affects the solution efficiency of the ERACC algorithm to a certain extent

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

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0042] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with specific examples.

[0043] For ease of understanding, before introducing the method of the present invention, the relevant technical names are defined:

[0044] CNF formula set: a series of conjunctions of clauses whose symbolic form is C 1 ∧C 2 ∧C 3 ∧...∧C m ; where C j for the clause.

[0045] variable: the symbolic form x of the variable, its negation

[0046] Neighbor variables: Two variables appear in at least one clause at the same time, then the two variables are said to be neighbor variables.

[0047] Literal: Expressed as a variable or the negation of a variable.

[0048] Flip text: negate the text, the negation of x is and negation of x.

[0049] Clause: a disjunctive expression composed of a series of words (ie variable or negation of variable), its symbolic form l ...

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 method for solving a Boolean satisfiability problem based on an extension rule, and the method comprises the steps: firstly designing a CCAER heuristic expression and PAWSERplanning suitable for the extension rule, and inventing a Subscoerer attribute and a CScoreer attribute of variables, wherein the CCAER heuristic expression is a certain overturning opportunity givento variables which exceed a certain threshold but have no change in pattern, and the PAWSER planning is mainly used for updating clause weights. For an example in a phase change interval, the CScoreerattribute of the variables is adopted; for an example which is not in a phase change interval, the Subscoerer attribute of a variable is adopted. Then, during initialization, an IMOM thought is utilized to obtain an initial maximum item, so that an initial solution is closer to an actual solution space, and the number of overturning times is reduced; and finally, the satisfiability of the subspace is judged in the searching process, if the satisfiability is met, a solution is found, and otherwise, we continue to judge the satisfiability of the whole space.

Description

technical field [0001] The invention relates to the technical field of solving Boolean satisfiability problems, in particular to a method for solving Boolean satisfiability problems based on extended rules. Background technique [0002] Boolean Satisfiability Problem (SAT problem for short) is a well-known decision problem, which not only has a pivotal research position in mathematical logic and computational theory, but also has high application value in the field of actual production. The SAT problem is a basic problem in logic, and it is also the core problem in computer science and artificial intelligence research today. Many important issues in engineering technology, military affairs, business administration, transportation and natural science research, such as automatic switching of program-controlled telephones, maintenance of large databases, automatic wiring of large-scale integrated circuits, automatic software development, robot action planning, etc. Can be conv...

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): G06N5/04
CPCG06N5/04
Inventor 王金艳胡春李先贤
Owner GUANGXI NORMAL UNIV
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