A folding rule for eliminating existential variables from constraint logic programs

DOI10.3233/FI-2009-183MaRDI QIDQ3400572zbMATH OpenOpenAlexFDO

Authors Valerio Senni, Alberto Pettorossi, Maurizio Proietti

Publication date 5 February 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-183

zbMATH Keywords

constraint logic programmingfolding ruleprogram transformationvariable elimination

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• scientific article; zbMATH DE number 549961
• A Generalization of the Folding Rule for the Clark-Kunen Semantics

Cited in

(3)

• An Algorithm for Local Variable Elimination in Normal Logic Programs
• Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs

This page was built for publication: A folding rule for eliminating existential variables from constraint logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400572)