427 search results - page 4 / 86 » A Graph Based Synthesis Algorithm for Solving CSPs |
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
AAAI
1994
13 years 9 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
FLAIRS
2006
13 years 9 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
IJCAI
2003
13 years 9 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...