Re: Using rules in abductive way

seguso wrote: 
You scared the hell out of me. I did not imagine the question was so
difficult. :-) Thanks for the info.


Don't stop at being scared :-)
There are many people who made phd's about tabling, and still, often
one can program some pragmatic but useful memoization.
Same for abduction.
Maybe you don't want the most general stuff, that works in recursive
programs, deals with negation, derives minimal sets of abduced literals,
with a minimal number of new skolem constants  etc. In that case, you
might still do useful stuff.
So, how far did you intend to go ?

Cheers

Bart Demoen
.