Transformation Rules for Locally Stratified Constraint Logic Programs

Simple item page
dc.creatorFioravanti, Fabio
dc.creatorPettorossi, Alberto
dc.creatorProietti, Maurizio
dc.date2004-02-20
dc.date.accessioned2026-07-07T03:20:56Z
dc.date.available2026-07-07T03:20:56Z
dc.descriptionWe 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.
dc.descriptionTo appear in: M. Bruynooghe, K.-K. Lau (Eds.) Program Development in Computational Logic, Lecture Notes in Computer Science, Springer
dc.identifierhttps://arxiv.org/abs/cs/0402048
dc.identifierhttp://arxiv.org/abs/cs/0402048
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32011
dc.subjectProgramming Languages
dc.subjectLogic in Computer Science
dc.subjectD.1.2;D.1.6;I.2.2;F.3.1
dc.titleTransformation Rules for Locally Stratified Constraint Logic Programs
dc.typetext

Files

Collections

arXiv