4959 search results - page 421 / 992 » Imperative Functional Programming |
190
Voted
CP
2003
Springer
16 years 24 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
375
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
223
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
165
click to vote
LFP
1992
15 years 8 months ago
1992
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
159
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...