Incremental Tabling in Support of Knowledge Representation and Reasoning

TL;DR

This paper introduces transparent incremental tabling for logic systems, enabling efficient, consistent updates and improved performance in knowledge representation and reasoning frameworks.

Contribution

It presents a new implementation of incremental tabling that supports updates in the well-founded semantics with enhanced efficiency and control.

Findings

Supports updates in 3-valued well-founded semantics

Achieves significant performance improvements

Ensures full consistency of tabled queries

Abstract

Resolution-based Knowledge Representation and Reasoning (KRR) systems, such as Flora-2, Silk or Ergo, can scale to tens or hundreds of millions of facts, while supporting reasoning that includes Hilog, inheritance, defeasibility theories, and equality theories. These systems handle the termination and complexity issues that arise from the use of these features by a heavy use of tabled resolution. In fact, such systems table by default all rules defined by users, unless they are simple facts. Performing dynamic updates within such systems is nearly impossible unless the tables themselves can be made to react to changes. Incremental tabling as first implemented in XSB (Saha 2006) partially addressed this problem, but the implementation was limited in scope and not always easy to use. In this paper, we introduce transparent incremental tabling which at the semantic level supports updates in the 3-valued well-founded semantics, while guaranteeing full consistency of all tabled queries. Transparent incremental tabling also has significant performance improvements over previous implementations, including lazy recomputation, and control over the dependency structures used to determine how tables are updated.