A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs

DOI10.1007/978-3-540-89982-2_29MaRDI QIDQ5504662zbMATH OpenOpenAlexFDO

Authors Valerio Senni, Alberto Pettorossi, Maurizio Proietti

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)

Recommendations

• A folding rule for eliminating existential variables from constraint logic programs
• Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
• Computer Algebra in Scientific Computing
• An Algorithm for Local Variable Elimination in Normal Logic Programs
• An algebraic perspective of constraint logic programming
• scientific article; zbMATH DE number 2090033
• Elimination of local variables from definite logic programs
• An efficient algorithm of logic programming with constraint hierarchy
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Unfolding and fixpoint semantics of concurrent constraint logic programs

Cites work

• A transformation system for deductive database modules with perfect model semantics
• A Transformation System for Developing Recursive Programs
• A Unification Algorithm for Associative-Commutative Functions
• Complexity of matching problems
• scientific article; zbMATH DE number 4049128 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Matching in a class of combined non-disjoint theories.
• Program Development in Computational Logic
• Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
• The complexity of linear problems in fields
• Transformations of CLP modules
• Transforming constraint logic programs
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Unification theory

Cited in

(4)

• A folding rule for eliminating existential variables from constraint logic programs
• Productive corecursion in logic programming
• An Algorithm for Local Variable Elimination in Normal Logic Programs
• Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

This page was built for publication: A Folding Algorithm 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 Q5504662)