26th International Conference on Inductive Logic Programming

4th - 6th September 2016, London


2016

L

P






Competition


Time:

The agent can move adjacently so long as there is not a wall blocking the move. The agent is tired after all these maze problems, and might not have they energy to climb over the wall. At each time point, the probability that the agent has the energy to climb over the wall is 40%.

      Download Task File: PrologASP

Output


VALID(6,0.89654813617161244199)
VALID(7,0.89654813617161244199)
VALID(14,0.89654813617161244199)
VALID(0,0.89654813617161255301)
VALID(1,0.89654813617161255301)
VALID(2,0.89654813617161255301)
VALID(3,0.89654813617161255301)
VALID(4,0.89654813617161255301)
VALID(5,0.89654813617161255301)
VALID(8,0.89654813617161255301)
VALID(9,0.89654813617161255301)
VALID(10,0.89654813617161255301)
VALID(11,0.89654813617161255301)
VALID(12,0.89654813617161255301)
VALID(13,0.89654813617161255301)
VALID(15,0.89654813617161255301)