Learning Search Control Rules with EBL

UCPOP+EBL

Explain leaf level failures

Regress the explanations

to compute interior node

failure explanations

Use failure explanations to

set up control rules

Problems:

-- Most branches end in

depth-limits

>No analytical explanation

>Use preference rules?

-- THE Utility problem

>Learn general rules

>Keep usage statistics &

prune useless rules

If Polished(x)@S &

~Initially-True(Polished(x))

Then

REJECT

Stepadd(Roll(x),Cylindrical(x)@s)

(Kambhampati, Katukam, Qu, 95)

Previous slide

Next slide

Back to first slide

View graphic version