I\'m endeavouring t开发者_Go百科o use MiniSat to solve a constraint satisfaction problem. In first-order logic the problem is easily represented by a few discrete-domain variables and some predicates.
While learning Prolog, I tried to write a program solving CNF problem (the performance is not an issue), so I ended up with the following code to solve (!x||y||!z)&&(x||!y||z)&&(x||y||
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
I want to transform my clauses to conjuctive normal form. Clauses are changed each time i run my program, so i guess i need to built-in a tool in my program to do this for me. Is there any suggestionn
I\'m using Espresso logic minimizer to produce a minimized form of a set of boolean equations. However rather than generating logic for a programmable array logic (which is what Espresso is normally u
加载中,请稍侯......