Incremental Tabling in Support of Knowledge Representation and Reasoning

DOI10.1017/S1471068414000209MaRDI QIDQ2931264zbMATH OpenOpenAlexFDO

Authors Terrance Swift

Publication date 25 November 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.3547

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

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.

Recommendations

• Incremental theory reasoning methods for semantic tableaux
• Incremental Tabling for Query-Driven Propagation of Logic Program Updates
• scientific article; zbMATH DE number 30305
• Automated Deduction – CADE-20
• Logic Programming
• Handling Incomplete and Complete Tables in Tabled Logic Programs
• Tableaux for projection computation and knowledge compilation

Cites work

• A three-valued semantics for logic programmers
• An abstract machine for efficiently computing queries to well-founded models
• An overview of Ciao and its design philosophy
• Efficient access mechanisms for tabled logic programs
• Efficient tabling of structured data with enhanced hash-consing
• Making prolog more expressive
• Tabled evaluation with delaying for general logic programs
• The YAP prolog system
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• XSB: extending Prolog with tabled logic programming

Cited in

(3)

• Incremental Tabling for Query-Driven Propagation of Logic Program Updates
• Incremental and modular context-sensitive analysis
• Logic Programming

Describes a project that uses

Uses Software

• YAP-Prolog
• XSB
• XcelLog

This page was built for publication: Incremental Tabling in Support of Knowledge Representation and Reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931264)