Speculative Computations in Or-Parallel Tabled Logic Programs

摘要: Pruning operators, such as cut, are important to develop efficient logic programs they allow programmers reduce the search space and thus discard unnecessary computations. For parallel systems, presence of pruning operators introduces problem speculative A computation is named if it can be pruned during evaluation, therefore resulting in wasted effort when compared sequential execution. In this work we discuss problems behind management computations or-parallel tabled programs. tabling, not only answers found for query goal may valid, but also predicates invalidated. The here even more serious because achieve an implementation required have set valid released soon possible. To deal with this, propose a strategy deliver that safe from being pruned, present its OPTYap tabling system.