Inverse resolution is an inductive reasoning technique that involves inverting the resolution operator.

Operators

Inverse resolution takes information about the resolvent of a resolution step to compute possible resolving clauses. Two types of inverse resolution operator are in use in inductive logic programming: V-operators and W-operators. A V-operator takes clauses ${\textstyle R}$ and ${\textstyle C_{1}}$as input and returns a clause ${\textstyle C_{2}}$ such that ${\textstyle R}$ is the resolvent of ${\textstyle C_{1}}$ and ${\textstyle C_{2}}$. A W-operator takes two clauses ${\textstyle R_{1}}$ and ${\textstyle R_{2}}$ and returns thre clauses ${\textstyle C_{1}}$, ${\textstyle C_{2}}$ and ${\textstyle C_{3}}$ such that ${\textstyle R_{1}}$ is the resolvent of ${\textstyle C_{1}}$ and ${\textstyle C_{2}}$ and ${\textstyle R_{2}}$ is the resolvent of ${\textstyle C_{2}}$ and ${\textstyle C_{3}}$.^[1]

History

Inverse resolution was first introduced by Stephen Muggleton and Wray Buntine in 1988 for use in the inductive logic programming system Cigol.^[2] By 1993, this spawned a surge of research into inverse resolution operators and their properties.^[1]

Notes

References

• Nienhuys-Cheng, Shan-hwei; de Wolf, Ronald (1997). Foundations of inductive logic programming. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Spinger. pp. 174–177. ISBN 978-3-540-62927-6.
• Muggleton, S.H.; Buntine, W. (1988). "Machine invention of first-order predicate by inverting resolution". Proceedings of the 5th International Conference on Machine Learning. pp. 339–352. doi:10.1016/B978-0-934613-64-4.50040-2. ISBN 978-0-934613-64-4.