Transforming constraint logic programs

DOI10.1016/S0304-3975(97)00077-7zbMath0913.68042OpenAlexW1975155152MaRDI QIDQ1274969

N. Bensaou, Irène Guessarian

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00077-7

zbMATH Keywords

correctnessprogram transformationsconstraint logic programsleast fixpoint semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Determinization of conditional term rewriting systems ⋮ Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Unnamed Item ⋮ Transformations of CLP modules ⋮ A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs

Cites Work

• Transformations of CLP modules
• Declarative modeling of the operational behavior of logic languages
• A transformation system for deductive database modules with perfect model semantics
• A Transformation System for Developing Recursive Programs
• Transformation of logic programs: Foundations and techniques
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item