A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems.
Qingshan ChenYang XuJun LiuXingxing HePublished in: Int. J. Comput. Intell. Syst. (2017)
Keyphrases
- satisfiability problem
- learning algorithm
- conjunctive normal form
- np complete
- unit propagation
- theorem prover
- temporal logic
- boolean formula
- search algorithm
- propositional variables
- davis putnam
- phase transition
- clause learning
- davis putnam logemann loveland
- cnf formula
- sat problem
- stochastic local search algorithms
- stochastic local search
- max sat
- inference rules
- pspace complete
- search space
- sat instances
- membership queries
- mazurkiewicz traces
- logical framework
- theorem proving
- solving hard
- reinforcement learning
- constraint propagation
- boolean functions
- first order logic
- multi agent systems