Sciweavers

1712 search results - page 37 / 343
» Abstract Constraint Data Types
Sort
View
CP
2009
Springer
15 years 11 months ago
A Constraint on the Number of Distinct Vectors with Application to Localization
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...
Gilles Chabert, Luc Jaulin, Xavier Lorca
CSR
2009
Springer
15 years 5 months ago
On Random Ordering Constraints
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
Andreas Goerdt
MST
2008
124views more  MST 2008»
14 years 11 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
FOCS
1992
IEEE
15 years 3 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
ICFP
2006
ACM
15 years 11 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira