A Graph Theoretic Optimisation of Temporal Abductive Validation

Abductive validation for a theory T expressed in language LQCM is known to be exponential. Despite this, abductive validation over LQCM using the HT4 abductive inference engine is a useful technique for a large range of real-world theories. However, doubts persist about LTQCM: a time-based variant of LQCM. In LTQCM, abductive validation is executed for for theories used in long time-based simulations. Here we show that, in the special case where (i) the theory is only measured at a few time intervals and (ii) LTQCMis restricted to L ? TQCM (which contains only bi-state objects connected by symmetrical relations) then temporal abductive validation is practical.