Respected OC community, If I understood correctly, OpenCog can be used an an SMT solver. Considering this feature, how far OpenCog is from solving satisfiability problem for propositional logic in polynomial time complexity?
In explanation, I'm having a hunch about anti-axioms which derive all the contradictory anti-theorems. If, and only if a propositional logic formula belongs to such a set of anti-theorems, then it is not satisfiable. Can such anti-axioms be defined in OpenCog, maybe in URE? Did anyone try to measure actual processing time of such an approach? If not, what obstacles do you see in this approach? Any thoughts would be greatly appreciated. Finest regards, ivan v. -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/f40317fb-fbe1-41d7-bf19-c2c4fa48d1d8n%40googlegroups.com.
