I've got a library that I have to interface with which acts basically as a data source. When retrieving data, I can pass special "filter expressions" to that library, which later get translated to SQL WHERE part. These expressions are pretty limited. They must be in conjunctive normal form. Like: (A or B or C) and (D or E or F) and ... ...
Hi, If I have a formula like: FAx FAy (Ez(!A(x,z) v !A(y,z)) v B(x,y)) (FA = For All / E = Exists) The rules of skolemisation say that: if E is outside FA replace with a constant or if E is inside FA replace by a new function contain all the vars from outside the FA as arguments. So what do I do in this case? Can I just drop t...
i need to use sat solver for checking satisfiability of boolean expressions.. I have complex boolean expression like this is there any automatic cnf file converter so that i can give it straight to sat solver? I read the cnf format file.. but how to express this expression in .cnf file? i get confused when there is a conjunction ins...