非小句命题公式的一种转换判定方法
A Transformational Decision Procedure for Non-Clausal Propositional Formulas
摘要:
提出了一种判定命题公式有效性的判定方法。它基于Davis-Putnam方法,处理最初转换为负范式的命题公式。这个过程分割变量,但与其他基于Davis-Putnam方法的决策过程相比,它不会分支。相反,该过程迭代地对公式的片段进行有效性保持变换。转换只涉及包含所选变量的最小公式部分。在这个决策过程中,选择最佳变量进行拆分是至关重要的-它可以大大缩短决策过程。选择一个变量,该变量的拆分导致变换公式的最小大小。此外,决策过程执行大量的优化的基础上计算的增量集。某些优化会导致删除公式的片段。其他检测变量的一个单一的真值分配是足够的。关于这项研究的最新信息可以在http://www.sakharov.net/valid.html上找到。
英文摘要:
A decision procedure for detecting valid propositional formulas is presented. It is based on the Davis-Putnam method and deals with propositional formulas that are initially converted to negational normal form. This procedure splits variables but, in contrast to other decision procedures based on the Davis-Putnam method, it does not branch. Instead, this procedure iteratively makes validity-preserving transformations of fragments of the formula. The transformations involve only a minimal formula part containing occurrences of the selected variable. Selection of the best variable for splitting is crucial in this decision procedure - it may shorten the decision process dramatically. A variable whose splitting leads to a minimal size of the transformed formula is selected. Also, the decision procedure performs plenty of optimizations based on calculation of delta-sets. Some optimizations lead to removing fragments of the formula. Others detect variables for which a single truth value assignment is sufficient. The latest information about this research can be found at http://www.sakharov.net/valid.html
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。