Resolution structure in HornSAT and CNFSAT
Computational Complexity
2013-04-09 v1
Abstract
This article describes about the difference of resolution structure and size between HornSAT and CNFSAT. We can compute HornSAT by using clauses causality. Therefore we can compute proof diagram by using Log space reduction. But we must compute CNFSAT by using clauses correlation. Therefore we cannot compute proof diagram by using Log space reduction, and reduction of CNFSAT is not P-Complete.
Cite
@article{arxiv.1304.2026,
title = {Resolution structure in HornSAT and CNFSAT},
author = {Koji Kobayashi},
journal= {arXiv preprint arXiv:1304.2026},
year = {2013}
}
Comments
6 pages, English and Japanese (see Other formats - Source)