In recent work we defined resource-based answer set semantics, which is anextension to answer set semantics stemming from the study of its relationshipwith linear logic. In fact, the name of the new semantics comes from the factthat in the linear-logic formulation every literal (including negative ones)were considered as a resource. In this paper, we propose a query-answeringprocedure reminiscent of Prolog for answer set programs under this extendedsemantics 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.
展开▼
