A Data Structure for Subsumption-Based Tabling in Top-Down Resolution Engines for Data-Intensive Logic Applications

摘要

Using tables in top-down resolution engines is an effective way of optimization by avoiding recomputation of formerly derived facts. This effect can be even more exploited if, instead of considering only identical subgoals, facts from subsuming sugoals are reused. This is particularly of interest if recalculation is expensive, e.g, due to data transmission cost or the mere volume of data to be processed.