2015/04/01 by Alejandro Sánchez Guinea, Guinea, Alejandro Sanchez · 1 citation
Computer Science · #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Natural Language Processing Techniques
paper · pdf · doi:10.48550/arxiv.1504.00337
openalex publication_date 2015/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce the idea of an understanding with respect to a set of clauses as a satisfying truth assignment explained by the contexts of the literals in the clauses. Following this idea, we present a mechanical process that obtains, if it exists, an understanding with respect to a 3-SAT problem instance based on the contexts of each literal in the instance, otherwise it determines that none exists. We demonstrate that our process is correct and efficient in solving 3-SAT.