TL;DR
This paper introduces a novel algorithmic approach for solving the coInverse 3-SAT problem by leveraging closure properties under resolution and partial assignments, addressing its computational complexity.
Contribution
It presents a new method that directly solves the coInverse 3-SAT problem using closure under resolution and partial assignment properties.
Findings
The proposed algorithm effectively solves the coInverse 3-SAT problem.
Utilizes closure under resolution to simplify problem-solving.
Addresses the coNP-completeness of the problem.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Optimization and Packing Problems · Formal Methods in Verification