About Inverse 3-SAT
Data Structures and Algorithms
2013-08-27 v4 Logic in Computer Science
Abstract
The Inverse 3-SAT problem is known to be coNP Complete. This article shows a new interesting way to solve directly the problem by using closure under resolution and partial assignment properties. An algorithm is proposed which lets solve the (co)Inverse 3-SAT problem.
Keywords
Cite
@article{arxiv.1303.4324,
title = {About Inverse 3-SAT},
author = {Xavier Labouze},
journal= {arXiv preprint arXiv:1303.4324},
year = {2013}
}
Comments
8 pages