In this talk i will present the computation of inconsistency on a planning problem. Thus a function like in the inconsistency measure will be used to map the planning problem onto a number ranging from 0 to 1. Is the planning problem solvable, also consistent, then it gets mapped to a 0. For the unsolvable case a planning problem can be represented as inconsistent. While comparing two inconsistent planning problems, one can be found more inconsistent than the other. Thus it can be measured as in inconsistency measure and ordered by their value. The measuring can be done by stepwise erasement of the inconsistency or by directly calculating on the outcome of the search from the planning problem.
07.02.2019 - 10:15