java - 使用 DPLL sat 求解器求解

Question

我在中找到了一个 sat 求解器

http://code.google.com/p/aima-java/

我尝试了以下代码来使用 dpllsolver 求解表达式

输入是

(A <=> B) AND (C => D) AND (A AND C) AND (NOT (B AND D)) AND (NOT (B AND D AND E))

CNF更改器(mutator)将其变换为

 (  (  ( NOT A )  OR B ) AND  (  ( NOT B )  OR A ) )

它不考虑逻辑的其他部分，它只考虑第一项，如何使其正确工作？

请建议我是否有其他 sat 求解器可以做到这一点

PEParser parser = new PEParser();
CNFTransformer transformer=new CNFTransformer();
Sentence and;
Sentence transformedAnd;
DPLL dpll = new DPLL();

Sentence sentence = (Sentence) parser.parse("(A <=> B) AND (C => D) AND (A AND C) AND (NOT (B AND D)) AND (NOT (B AND D AND E))");
transformedAnd = transformer.transform(sentence);

System.out.println(transformedAnd.toString());
boolean satisfiable = dpll.dpllSatisfiable(transformedAnd);

System.out.println(satisfiable);

Answer 1

试试这个:http://www.sat4j.org/

我相信这项技术已被纳入 Eclipse Provisioning System P2 以解决插件依赖性问题。 http://blog.mancoosi.org/index.php/2008/06/01/4-edos-offspring-1-eclipse-p2-will-include-sat-solver-technology-for-managing-plugins