Query Proof Structure Caching for Incremental Evaluation of Tabled Prolog Programs

Abstract

The incremental evaluation of logic programs maintains the tabled answers in a complete

JPL : Implementation of a Prolog System Supporting Incremental Tabulation

“…Tabled extension for Logic Programming (TLP) [4,5,6] evaluation enhances the performance of the Prolog query engine and allows the termination of certain computations that do not terminate under the normal Prolog query evaluation. The incremental evaluation [7,8] of tabled Prolog programs allows to maintain the correctness (soundness) and completeness of the tabled answers under the dynamic state. This evaluation strategy allows the system to update the tabled answers when the set of facts and/or rules participated in generating the answers of a certain query are either retracted from or asserted to the Prolog program.…”

“…This evaluation strategy allows the system to update the tabled answers when the set of facts and/or rules participated in generating the answers of a certain query are either retracted from or asserted to the Prolog program. JPL [7,9] presented an approach of maintaining one consolidate system to cache the query answers under the nonmonotonic logic. It uses the justification-based truth-maintenance system to support the incremental evaluation of tabled Prolog Programs.…”