A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs

DOI10.1007/978-3-540-89982-2_29zbMath1185.68184OpenAlexW2122198133MaRDI QIDQ5504662

Valerio Senni, Maurizio Proietti, Alberto Pettorossi

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/40028

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Productive corecursion in logic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformations of CLP modules
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Complexity of matching problems
• The complexity of linear problems in fields
• A transformation system for deductive database modules with perfect model semantics
• Transforming constraint logic programs
• A Unification Algorithm for Associative-Commutative Functions
• A Transformation System for Developing Recursive Programs
• Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
• Program Development in Computational Logic
• Automated Deduction – CADE-19

This page was built for publication: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs