The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...