Query answering in resource-based answer set semantics

DOI10.1017/S1471068416000478MaRDI QIDQ4593046zbMATH OpenFDO

Authors Stefania Costantini, Andrea Formisano

Publication date 9 November 2017

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

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

zbMATH Keywords

answer set programmingprocedural semanticstop-down query-answering

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

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.

Recommendations

• Negation as a resource: a novel view on answer set semantics
• Negation as a resource: a novel view on answer set semantics
• Answer Set Programming with Resources
• Logics in Artificial Intelligence
• Answer set programs with queries over subprograms

Cites work

• scientific article; zbMATH DE number 410424 (Why is no real title available?)
• scientific article; zbMATH DE number 741348 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• A goal-oriented approach to computing the well-founded semantics
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• Answer Set Programming with Resources
• Autoepistemic logic
• Design and results of the Fifth Answer Set Programming Competition
• Dynamic consistency checking in goal-directed answer set programming
• Extending and implementing the stable model semantics
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming for Knowledge Representation
• Logic programming and negation: A survey
• Monotonic Answer Set Programming
• Negation as a resource: a novel view on answer set semantics
• On the relation among answer set solvers
• RASP and ASP as a fragment of linear logic
• Semantics and complexity of recursive aggregates in answer set programming
• Tableau Calculi for Answer Set Programming
• The well-founded semantics for general logic programs
• Weight constraints with preferences in ASP
• XSB: extending Prolog with tabled logic programming

Cited in

(8)

• Intelligent query answering in rule based systems
• Efficiently Querying RDF(S) Ontologies with Answer Set Programming
• Better paracoherent answer sets with less resources
• scientific article; zbMATH DE number 7455722 (Why is no real title available?)
• Negation as a resource: a novel view on answer set semantics
• Negation as a resource: a novel view on answer set semantics
• About epistemic negation and world views in epistemic logic programs
• Adding Metalogic Features to Knowledge Representation Languages*

Describes a project that uses

Uses Software

• XSB

This page was built for publication: Query answering in resource-based answer set semantics

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