Paper Info
Title
Query answering in resource-based answer set 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.(1) We prove formal properties of the proposed procedure. Under consideration for acceptance in TPLP.
Year
DOI
Venue
2016
10.1017/S1471068416000478
THEORY AND PRACTICE OF LOGIC PROGRAMMING
Keywords
DocType
Volume
Answer Set Programming,Procedural Semantics,Top-down Query-answering
Journal
16
Issue
ISSN
Citations 
5-6
1471-0684
0
PageRank 
References 
Authors
0.34
21
2
Name
Order
Citations
PageRank
Stefania Costantini153659.90
Andrea Formisano230132.94