3-SAT多项式解的知识识别算法
3-SAT Polynomial Solution of Knowledge Recognition Algorithm
摘要:
介绍了一种在多项式时间内求解3SAT问题的知识识别算法(KRA)。KRA通过演绎和还原迭代推理学习成员-类关系并检索信息。它应用中文COVA*(相当于一组8个3变元连词分句)原理,消除了“或”运算,解决了3-SAT问题。也就是说,KRA不直接搜索分配。它通过迭代的集合关系识别,在集合的每一层将补集识别为拒绝集。KRA识别哪个连接3变元子句是不可满足的。如果任何一组3变量子句的所有8个子句都被拒绝,则公式没有赋值。如果每个集合中至少有一个子句保留,则至少有一个赋值是每个集合的子句的并集。如果每个集合中有多个子句,则存在分别是每个集合的子句的并集的多个赋值。
英文摘要:
This paper introduces a knowledge recognition algorithm (KRA) for solving the 3SAT problem in polynomial time. KRA learns member-class relations and retrieves information through deductive and reductive iterative reasoning. It applies the principle of Chinese COVA* (equivalent to a set of eight 3-variable conjunctive clauses) and eliminates the "OR" operation to solve 3-SAT problem. That is, KRA does not search the assignment directly. It recognizes the complements as rejections at each level of the set through iterative set relation recognition. KRA recognizes which conjunctive 3-variable-clause is not satisfiable. If all the eight clauses of any set of 3-variable clauses are rejected, then there is not an assignment for the formula. If there is at least one clause in each set that remains, then there is at least one assignment that is the union of clauses of each set. If there is more than one clause in each set that remains, then there are multiple assignments that are the unions of the clauses of each set respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。