I would like to easily figure out which examples are prooved and by which clause. Basically, there is a counting of positive and negative examples covered by each leaf of the trees, and I would like to see the actual examples and the leaf responsible for that.
Hi there,
I would like to easily figure out which examples are prooved and by which clause. Basically, there is a counting of positive and negative examples covered by each leaf of the trees, and I would like to see the actual examples and the leaf responsible for that.
I saw that there are some provers in the package https://github.com/starling-lab/BoostSRL/blob/master/code/src/edu/wisc/cs/will/ResThmProver/, but it is not clear to me how to use one of them to figure out which examples are covered by each clause.
Is there a simple way to find for each clause the examples (both positive and negative) that this clause proves?
Thank you guys for your time