2017/01/10 by Chengling Fang, Jiang Liu, Fang, Chengling +1
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Methods in Verification #Machine Learning and Algorithms #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.1701.02401
openalex publication_date 2017/01/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the article \The State of SAT", the authors asked whether a procedure dramatically different from DPLL can be found for handling unsatisfiable instances. This study proposes a new linear programming approach to address this issue efficiently. Our experiments showed that the new method works for many unsatisfiable instances. However, we must concede that this method should be incomplete; otherwise, it will imply P=co-NP.