使用DPLL SAT求解器求解

Question

我在

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变压器将其转换为

 (  (  ( 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 Presisioning System P2中以求解插件依赖性。 http://blog.mancoosi.org/index.php/2008/06/01/4-Edos-credspring-1-eclipse-1-eclipse-p2-will-include-include-sat-sat-solver-solver-solver-technology-for-managing-managing-plugins