In a function , if two clauses are given as a input ,then how to resolve them together by applying the resolution rule? How to prove that contradiction has been found or not. Looking for LISP code .
Lisp Propositional resolution : Implement a theorem in Lisp
2 posts · 3847 views
Re: Lisp Propositional resolution : Implement a theorem in L
Please clarify your question. What exactly are you doing? Where are you getting stuck?