2LR An Algorithm for Solving Satisfiability Instances

José Torres-Jiménez, Adrian Ruiz-Cuevas, México Juan Frausto-Solís

msra（1998）

引用 23|浏览3

暂无评分

摘要

LR algorithm for solving propositional satisfiability (SAT) instances is presented, 2LR is a generalization of the 1LR algorithm proposed by Davis and Putnam. According to the 3SAT tested cases, 2LR requires in average less recursive calls than 1LR, given that the search tree size is reduced.

查看译文

关键词

2lr,sat,1lr,satisfiability

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要