1 Ahybrid algorithm for solving the satisfiability problem is proposed.

2 Two heuristic strategies for solving satisfiability ( SAT ) problem were presented.

3 The satisfiability problem is a key problem in computer science and artificial intelligence.

4 How to solve the Boolean Satisfiability Problem(SAT)by genetic algorithms is discussed. The applications of the results for other NP Complete problems are also shown.

5 The satisfiability problem of conjunction normal form ( abbreviate SAT problem ) is an NP _ complete problem.

6 Deciding satisfiability of clause set is one of the active research topics in the automated reasoning field.

7 This paper presents a modified simulated annealing algorithm for solving the satisfiability problem.

8 Our approach is based on an extended relational calculus,[] and reduces the consistency problem to a satisfiability problem of relational formulae.

9 A resolution principle for constrained clauses is proposed, where unification is replaced by testing constraints for satisfiability o...

10 When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.

11 The research of this paper is based on the Boolean Satisfiability ( SAT ) Problem of combinational circuit.

12 A resolution principle for constrained clauses is proposed, where unification is replaced by testing constraints for satisfiability over the cons...

13 In this paper, an efficient method integrating logic simulation and Boolean satisfiability (SAT) is presented, which can verify the designs with black boxes.