| 1. |
- Beldiceanu, Nicolas, et al.
(author)
-
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
- 2014. - 7
-
In: Principles and Practice of Constraint Programming. - Cham : Springer International Publishing. - 9783319104270 ; , s. 142-157
-
Conference paper (peer-reviewed)abstract
- Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them. Using such an automaton for such a constraint, we derive an implied constraint between the result variables for a sequence, a prefix thereof, and the corresponding suffix. We show the usefulness of this implied constraint in constraint solving, both by local search and by propagation-based systematic search.
|
|
| 2. |
- Li, Shuo, et al.
(author)
-
Case Study : Constraint Programming in a System Level Synthesis Framework
- 2014
-
In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014. - Cham : Springer International Publishing. - 9783319104287 - 9783319104270 ; , s. 846-861
-
Conference paper (peer-reviewed)abstract
- This article presents a case study of using a constraint programming solver in a system level synthesis framework called SYLVA. The solver is used to find the repetition vector of a synchronous data flow graph and serving as the design space exploration engine, which rapidly finds qualified system implementations by solving a constraint satisfaction optimization problem. Each system implementation is a combination of a number of function implementation instances and their cycle accurate execution schedules. The problem to be solved is automatically generated based on the user inputs: 1) a system model to be synthesized, 2) a library containing all the usable function implementations, 3) the performance/cost constraints, and 4) the optimization objectives. Use of constraints programming technique enabled a low cost development of design space exploration engine in addition to gaining ease of use.
|
|
| 3. |
- Schulte, Christian, et al.
(author)
-
View-Based Propagator Derivation
- 2014
-
In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014. - Cham : Springer International Publishing. - 9783319104287 - 9783319104270 ; , s. 938-942
-
Conference paper (peer-reviewed)abstract
- When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance. This abstract shows how to use views to derive propagator variants where derived propagators are perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators are developed, and the abstract sketches an implementation architecture for views that is independent of the underlying constraint programming system. Evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.
|
|
