7 search results - page 1 / 2 » agp 1999 |
167
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
116
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
149
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
127
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
140
Voted
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Regarding the precision of combined domains including Jacobs and Langen's Sharing there is a core of techniques, such as the standard integration with freeness and linearity ...