Query Answering in Resource-Based Answer Set Semantics

TL;DR

This paper introduces a query-answering procedure for resource-based answer set semantics, extending logic programming with a resource perspective inspired by linear logic, and proves its formal properties.

Contribution

It proposes a Prolog-like query-answering method for resource-based answer set semantics, extending existing logic programming techniques.

Findings

The procedure is formally sound and complete.

It extends XSB-resolution to resource-based semantics.

The approach facilitates practical query answering under the new semantics.

Abstract

In recent work we defined resource-based answer set semantics, which is an extension to answer set semantics stemming from the study of its relationship with linear logic. In fact, the name of the new semantics comes from the fact that in the linear-logic formulation every literal (including negative ones) were considered as a resource. In this paper, we propose a query-answering procedure reminiscent of Prolog for answer set programs under this extended semantics as an extension of XSB-resolution for logic programs with negation. We prove formal properties of the proposed procedure. Under consideration for acceptance in TPLP.