A novel approach of solving the CNF-SAT problem
Artificial Intelligence
2013-07-25 v1 Logic in Computer Science
Abstract
In this paper, we discussed CNF-SAT problem (NP-Complete problem) and analysis two solutions that can solve the problem, the PL-Resolution algorithm and the WalkSAT algorithm. PL-Resolution is a sound and complete algorithm that can be used to determine satisfiability and unsatisfiability with certainty. WalkSAT can determine satisfiability if it finds a model, but it cannot guarantee to find a model even there exists one. However, WalkSAT is much faster than PL-Resolution, which makes WalkSAT more practical; and we have analysis the performance between these two algorithms, and the performance of WalkSAT is acceptable if the problem is not so hard.
Keywords
Cite
@article{arxiv.1307.6291,
title = {A novel approach of solving the CNF-SAT problem},
author = {Xili Wang},
journal= {arXiv preprint arXiv:1307.6291},
year = {2013}
}