Tabling with Sound Answer Subsumption

TL;DR

This paper examines the soundness issues in tabling with answer subsumption in logic programming, providing a formal framework and criteria to ensure correct fixed point semantics.

Contribution

It introduces a formal framework that generalizes existing answer subsumption approaches and establishes a soundness criterion for logic program tabling.

Findings

Existing implementations can fail to produce least fixed points.

A formal framework for sound answer subsumption is proposed.

Soundness criteria help identify correct applications of answer subsumption.

Abstract

Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but only require an aggregation of those answers. Several works have studied efficient techniques, such as lattice-based answer subsumption and mode-directed tabling, to do so for various forms of aggregation. While much attention has been paid to expressivity and efficient implementation of the different approaches, soundness has not been considered. This paper shows that the different implementations indeed fail to produce least fixed points for some programs. As a remedy, we provide a formal framework that generalises the existing approaches and we establish a soundness criterion that explains for which programs the approach is sound. This article is under consideration for acceptance in TPLP.