Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

DOI10.1007/11799573_15MaRDI QIDQ5449600zbMATH OpenOpenAlexFDO

Authors Alberto Pettorossi, Maurizio Proietti, Valerio Senni

Publication date 11 March 2008

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11799573_15

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A folding rule for eliminating existential variables from constraint logic programs
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Proving theorems by program transformation
• scientific article; zbMATH DE number 1140685
• CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1

Cited in

(6)

• A folding rule for eliminating existential variables from constraint logic programs
• CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1
• scientific article; zbMATH DE number 1140685 (Why is no real title available?)
• An Algorithm for Local Variable Elimination in Normal Logic Programs
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Proving program properties as first-order satisfiability

This page was built for publication: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

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