A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
type: Item
instance of: scholarly article
title: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
zbMATH Open document ID: 1185.68184
DOI: 10.1007/978-3-540-89982-2_29
author: Valerio Senni
author: Alberto Pettorossi
author: Maurizio Proietti
published in: Logic Programming
publication date: 2009-01-22T00:00:00Z
full work available at URL: http://hdl.handle.net/2108/40028
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 5496699
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2122198133
cites work: Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
cites work: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
cites work: A Transformation System for Developing Recursive Programs
cites work: A transformation system for deductive database modules with perfect model semantics
cites work: Transformations of CLP modules
cites work: Transforming constraint logic programs
cites work: Program Development in Computational Logic
cites work: Q3992908
cites work: Q3818127
cites work: The complexity of linear problems in fields
cites work: Unification theory
cites work: Q4799892
cites work: Complexity of matching problems
cites work: A Unification Algorithm for Associative-Commutative Functions
cites work: Q3786017
cites work: Matching in a class of combined non-disjoint theories.
Recommended article: A folding rule for eliminating existential variables from constraint logic programs
Recommended article: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables
Recommended article: Computer Algebra in Scientific Computing
Recommended article: An Algorithm for Local Variable Elimination in Normal Logic Programs
Recommended article: An algebraic perspective of constraint logic programming
Recommended article: Q4808700
Recommended article: Elimination of local variables from definite logic programs
Recommended article: An efficient algorithm of logic programming with constraint hierarchy
Recommended article: Unfolding and fixpoint semantics of concurrent constraint logic programs
description: scientific article; zbMATH DE number 5496699