Transformation Rules for Locally Stratified Constraint Logic Programs

We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. We give sufficient conditions which ensure that the proposed set of transformation rules preserves the perfect model of t...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Fioravanti, Fabio, Pettorossi, Alberto, Proietti, Maurizio
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 20.02.2004
Subjects
Graphs
Logic programming
Logic programs
Transformations
Online AccessGet full text

Cover

More Information
Summary:We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. We give sufficient conditions which ensure that the proposed set of transformation rules preserves the perfect model of the programs. Our rules extend in some respects the rules for logic programs and constraint logic programs already considered in the literature and, in particular, they include a rule for unfolding a clause with respect to a negative literal.
ISSN:2331-8422