Applications of abduction: Testing very long qualitative simulations
We can test a theory of "X" by checking if that theory can reproduce known behavior of "X" In the general case, this check for time-based simulations is only practical for short simulation runs. We show that, given certain reasonable language restrictions, the complexity of this check reduces to the granularity of the measurements. That is, provided a very long simulation run is only measured infrequently, this check is feasible.
abduction complexity validation qualitative reasoning