2109 search results - page 33 / 422 » Solving Necklace Constraint Problems |
170
click to vote
ISSTA
1998
ACM
15 years 8 months ago
1998
ACM
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
133
click to vote
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
191
click to vote
TASE
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
126
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
136
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...