7092 search results - page 240 / 1419 » Parallelizing constraint programs |
184
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
183
click to vote
POPL
2002
ACM
16 years 27 days ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
77
Voted
UM
2009
Springer
15 years 7 months ago
2009
Springer
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
101
Voted
CP
2003
Springer
15 years 5 months 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...
105
click to vote
ESOP
1992
Springer
15 years 4 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...