Islands for SAT
H. Fang, Y. Kilani, J.H.M. Lee, and P.J. Stuckey
TL;DR
This paper introduces the concept of islands to restrict local search in CNF SAT problems, demonstrating how search space can be significantly reduced by focusing on these islands.
Contribution
It presents a novel method for constructing islands in CNF SAT problems and analyzes their impact on search space reduction.
Findings
Search space can be greatly reduced by using islands.
Constructing islands is feasible for CNF SAT problems.
Restricting search to islands improves efficiency.
Abstract
In this note we introduce the notion of islands for restricting local search. We show how we can construct islands for CNF SAT problems, and how much search space can be eliminated by restricting search to the island.
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 · AI-based Problem Solving and Planning · Advanced Graph Theory Research