Making assumptions in the automated derivation
This paper proposes a mechanism to integrate conditional proof, which is an important proof technique in deductive logic, into logic programming to enhance the power of deduction. Concentrating on two existing resolution strategiesSLD-resolution and PT-resolution, it analyses the necessity and feasibility of the integration, and formulates the procedure.
conditional proof logic programming sld-resolution pt-resolution