How can we prove that a proof search method is not an instance of another?

04/24/2023
by   Guillaume Burel, et al.
0

We introduce a method to prove that a proof search method is not an instance of another. As an example of application, we show that Polarized resolution modulo, a method that mixes clause selection restrictions and literal selection restrictions, is not an instance of Ordered resolution with selection.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset