Resolution structure in HornSAT and CNFSAT

TL;DR

This paper explores the structural differences in resolution between HornSAT and CNFSAT, highlighting how HornSAT can be efficiently computed using clauses causality, unlike CNFSAT which relies on clauses correlation.

Contribution

It demonstrates that HornSAT can be computed via clauses causality with Log space reduction, whereas CNFSAT cannot, showing a fundamental complexity distinction.

Findings

HornSAT is computable by clauses causality using Log space reduction.

CNFSAT relies on clauses correlation and is not P-Complete.

Proof diagrams for HornSAT are computable within Log space, unlike CNFSAT.

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.