Transformation Rules for Locally Stratified Constraint Logic Programs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
To appear in: M. Bruynooghe, K.-K. Lau (Eds.) Program Development in Computational Logic, Lecture Notes in Computer Science, Springer

Keywords

Programming Languages, Logic in Computer Science, D.1.2;D.1.6;I.2.2;F.3.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32011

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0402048
 http://arxiv.org/abs/cs/0402048

Collections

arXiv