Question: Suppose one writes a logic program that carries out a resolution inference step. That is, let Resolve (c1, c2, c) succeed if c is the
Suppose one writes a logic program that carries out a resolution inference step. That is, let Resolve (c1, c2, c) succeed if c is the result of resolving cl and c2. Normally Resolve would be used as part of a theorem prover by calling it with c1 and c2 instantiated to particular clauses, thereby generating the re-solvent c. Now suppose instead that we call it with un-instantiated and c1 and c2 un-instantiated. Will this succeed in generating the appropriate results of an inverse resolution step? Would you need any special modifications to the logic programming system for this to work?
Step by Step Solution
3.38 Rating (176 Votes )
There are 3 Steps involved in it
We will assume that Prolog is the logic programming language It is certainl... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
21-C-S-A-I (275).docx
120 KBs Word File
