RASP and ASP as a fragment of linear logic

DOI10.1080/11663081.2013.798997zbMath1400.68047OpenAlexW2038042849MaRDI QIDQ4583307

Stefania Costantini, Andrea Formisano

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2013.798997

zbMATH Keywords

linear logicresource managementanswer set programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Query answering in resource-based answer set semantics

Uses Software

• ASP
• RASP
• Lolli

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Contributions to the stable model semantics of logic programs with negation
• Decision problems for propositional linear logic
• Logic programming in a fragment of intuitionistic linear logic
• The complexity of Horn fragments of linear logic
• Strong Equivalence of RASP Programs
• Extending and Implementing RASP
• On the existence of stable models of non-stratified logic programs
• Answer Set Programming with Resources
• Modeling preferences and conditional preferences on resource consumption and production in ASP
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• A linear axiomatization of negation as failure
• A Uniform Proof-theoretic Investigation of Linear Logic Programming
• Logic programming and negation: A survey
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Twelve Definitions of a Stable Model
• Strongly equivalent logic programs