基于路径搜索的格值命题逻辑自动推理方法

Automated ReasoningMethod Based on Path Searching for Lattice Propositional Logic Formulae

摘要: 提出一种基于路径搜索的自动推理算法.除了采取预处理外,还采用了动态的删除策略,使对大部分路径的搜索变成对一条路径搜索.可快速地完成对一类格值命题逻辑中的任何一个子句集可满足性与不可满足性的判定.文中还讨论了该算法计算的复杂性.
- 自动推理 /
- 路径 /
- 子句集 /
- 互补对
Abstract: A new automated reasoning method based on path searching is put forward. This method adopts pre-processing and dynamic deletion strategies so as to convertmulti-path searching into one-path searching. It can be used to validate the unsatisfiability of lattice-valued propositional logic formulae quickly. In addition, the soundness and completeness of the method are proved.
- automated reasoning /
- route /
- clause set /
- complementary pair

点击查看大图