I’m having a little trouble understanding the question. I think you may be thinking of either philosophical abduction/induction or logical abduction/induction.
Abduction in this article is just computing P(y | x) when x is a causal descendant of y. It’s not conceptually different from any other kind of conditioning.
In a different context, I can say that I’m fond of Isil Dillig’s thesis work on an abductive SAT solver and its application to program verification, but that’s very unrelated.
I’m having a little trouble understanding the question. I think you may be thinking of either philosophical abduction/induction or logical abduction/induction.
Abduction in this article is just computing P(y | x) when x is a causal descendant of y. It’s not conceptually different from any other kind of conditioning.
In a different context, I can say that I’m fond of Isil Dillig’s thesis work on an abductive SAT solver and its application to program verification, but that’s very unrelated.