Strong equivalence of RASP programs

Authors:
Stefania Costantini;Andrea Formisano;David Pearce
Affiliations:
Università di L'Aquila, Italy;Università di Perugia, Italy;Universidad Politècnica de Madrid, Spain
Venue:
Correct Reasoning
Year:
2012

Citing 9
Cited 1

Linear logic

Theoretical Computer Science
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Developing a Declarative Rule Language for Applications in Product Configuration

PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Stable Model Semantics of Weight Constraint Rules

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
The Description Logic Handbook

The Description Logic Handbook
Modeling preferences and conditional preferences on resource consumption and production in ASP

Journal of Algorithms
Answer Set Programming with Resources

Journal of Logic and Computation
Extending and Implementing RASP

Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009

Nested Weight Constraints in ASP

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

RASP is a recent extension of Answer Set Programming (ASP) that permits declarative specification and reasoning on consumption and production of resources. In this paper, we extend the concept of strong equivalence (which, as widely recognized, provides an important conceptual and practical tool for program simplification, transformation and optimization) from ASP to RASP programs and discuss its applicability, usefulness and implications in this wider context.