Sciweavers

45 search results - page 2 / 9
» QL-implications: Some properties and intersections
Sort
View
AI
2008
Springer
13 years 5 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder
WOLLIC
2009
Springer
14 years 11 days ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 24 days ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
ICFP
2000
ACM
13 years 10 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
TCS
2008
13 years 5 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol