keyboard_arrow_up
Query Proof Structure Caching for Incremental Evaluation of Tabled Prolog Programs

Authors

Taher Ali1, Ziad Najem2 and Mohd Sapiyan1, 1Gulf University for Science and Technology, Kuwait and 2Kuwait University, Kuwait

Abstract

The incremental evaluation of logic programs maintains the tabled answers in a complete and consistent form in response to the changes in the database of facts and rules. The critical challenges for the incremental evaluation are how to detect which table entries need to change, how to compute the changes and how to avoid the re-computation. In this paper we present an approach of maintaining one consolidate system to cache the query answers under the non-monotonic logic. We use the justification-based truth-maintenance system to support the incremental evaluation of tabled Prolog Programs. The approach used in this paper suits the logic based systems that depend on dynamic facts and rules to benefit in their performance from the idea of incremental evaluation of tabled Prolog programs. More precisely, our approach favors the dynamic rules based logic systems.

Keywords

Incremental evaluation of tabled Prolog, Incremental tabulation for Prolog queries, Justification based truth maintenance systems, Tabulation, Memoing.

Full Text  Volume 4, Number 1