Target algorithm prediction method for Boolean satisfiability problem based on graph

A technology of Boolean satisfiability and prediction methods, applied in the computer field, can solve problems such as impossible to understand, save considerable cost, time-consuming, etc., and achieve the effect of saving the cost of artificial design features

Inactive Publication Date: 2020-02-21
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF4 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The Boolean satisfiability problem (SAT) is the first proven NP-Complete problem. Most of the algorithm prediction research based on this problem is manual analysis of the problem and manual construction of features, which is very time-consuming and labor-intensive. , and the subjectivity of the researcher will also bring some bias into the construction of the problem characteristics
Later, a method based on neural network can automatically learn the characteristics of the problem and summarize the rules predicted by the algorithm. The defect of the input format, it does not help us to save considerable cost, nor is it possible to help people understand the law behind the algorithm prediction

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
  • Target algorithm prediction method for Boolean satisfiability problem based on graph
  • Target algorithm prediction method for Boolean satisfiability problem based on graph
  • Target algorithm prediction method for Boolean satisfiability problem based on graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] The present invention will be further explained below in conjunction with the accompanying drawings.

[0035]The Conjunctive Normal Form (CNF) representation of the Boolean satisfiability problem (SAT) is composed of strings line by line, such as figure 1 As shown in , each line represents a disjunctive item (clause), the number separated by spaces in the line is the number of the proposition variable (variable), and the number 0 at the end of the line is a newline placeholder. When constructing a graph structure, each propositional variable is regarded as a node of the graph. It should be noted that the normal form and its logical non-form of the same propositional variable represent different nodes respectively. If any two different variables appear in the same disjunction item at the same time, an edge is made between these two nodes. In addition, if a variable has two states, an edge is also required between these two nodes side to describe this relationship. Two ...

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 target algorithm prediction method for Boolean satisfiability problems based on a graph, and the method comprises the following steps: designing a graph structure, inputtingthe original definition of each Boolean satisfiability problem in a problem set, outputting related graph structure representation, and constructing a graph structure data set corresponding to an original problem; building a conversion model from a graph structure to a document structure, and building a document data set corresponding to the original Boolean satisfiability problem; building a document vectorization model, and building a group of vectors corresponding to the original Boolean satisfiability problem; and selecting a classification model or a regression model, and training the model to enable the model to learn to predict a target algorithm of the Boolean satisfiability problem. According to the method, the powerful representation capability of the graph is utilized, the original representation of each SAT problem is converted into the logic representation of the graph, effective features are learned from the graph in an unsupervised mode, and finally target algorithm prediction of the problems is learned and applied according to the features.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a target algorithm prediction method for analyzing a Boolean satisfiability problem using a graph structure. Background technique [0002] The decision problem is a classic problem in the computer field, and it is also a problem that exists widely in the real world. It is similar to the following problem description. Given all the inputs required by the problem, the output is yes or no. In general, the output of the problem is determined to be yes. How to obtain the input that satisfies this output is our goal. According to the difficulty of the problem, decisive problems are divided into P, NP, NP-Complete and NP-Hard grades. The P problem is the simplest deterministic problem, which can be solved in polynomial time. However, for the other three classes of problems, there is no algorithm that can solve it in polynomial time in a broad sense. They can only be solve...

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): G06Q10/04G06F16/901G06N3/08
CPCG06Q10/04G06F16/9024G06N3/088
Inventor 张立言程劲松
Owner NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
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