A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Set Constraints and Logic Programming
1998
Information and Computation
Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet. They are the main ingredient i n s e tbased program analysis 4, 5, 15, 16, 19, 23, 24, 26] . In this paper we describe a constraint logic programming language clp(sc) over set constraints in the style of Ja ar and Lassez 17]. The language subsumes ordinary logic programs over an Herbrand domain. We g i v e an e cient uni cation algorithm and operational, declarative, and xpoint s e
doi:10.1006/inco.1997.2694
fatcat:vemmnq3chrdyrgvtdhg6kd5pny