Solvability of HornSAT and CNFSAT
Computational Complexity
2013-01-01 v1
Abstract
This article describes the solvability of HornSAT and CNFSAT. Unsatisfiable HornCNF have partially ordered set that is made by causation of each clauses. In this partially ordered set, Truth value assignment that is false in each clauses become simply connected space. Therefore, if we reduce CNFSAT to HornSAT, we must make such partially ordered set in HornSAT. But CNFSAT have correlations of each clauses, the partially ordered set is not in polynomial size. Therefore, we cannot reduce CNFSAT to HornSAT in polynomial size.
Keywords
Cite
@article{arxiv.1212.6725,
title = {Solvability of HornSAT and CNFSAT},
author = {Koji Kobayashi},
journal= {arXiv preprint arXiv:1212.6725},
year = {2013}
}
Comments
3 pages, English and Japanese (see Other formats - Source)