I doubt there is much of a connection. Prolog programs don't have any termination guarantees, so you can't use them to prove any theorems (since a program is supposed to correspond to a proof, but a non-terminating program is a proof with a big hole in it).
w
wtaysom
07/15/2021, 11:42 AM
@Nick Smith The linked article jumps right at it by implementing "the resolution calculus for propositional logic" and "_not_ using Prolog's built-in search strategy as the search strategy of the prover!"
So @Emmanuel Oga, I'd say that