Computation of Satisfiability Degree Based on CNF.
Pei HuGuiming LuoChongyuan YinPublished in: FSKD (6) (2009)
Keyphrases
- sat solving
- satisfiability problem
- conjunctive normal form
- np complete
- sat problem
- cnf formula
- boolean functions
- information systems
- boolean formula
- special case
- temporal logic
- sat solvers
- sat instances
- stochastic local search
- satisfiability testing
- real time
- efficient computation
- randomly generated
- propositional logic
- phase transition