| 1. |
|
|
| 2. |
- Arafailova, Ekaterina, et al.
(författare)
-
Global Constraint Catalog Volume II: Time-Series Constraints
- 2016
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of structural time-series constraints where each constraint is explicitly described in terms of automata with accumulators.
|
|
| 3. |
- Arafailova, Ekaterina, et al.
(författare)
-
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints
- 2016
-
Ingår i: Principles and Practice of Constraint Programming. - Cham : Springer Publishing Company. - 9783319449524 - 9783319449531 ; , s. 13-29
-
Konferensbidrag (refereegranskat)abstract
- Integer time series are often subject to constraints on the aggregation of the integer features of all occurrences of some pattern within the series. For example, the number of inflexions may be constrained, or the sum of the peak maxima, or the minimum of the peak widths. It is currently unknown how to maintain domain consistency efficiently on such constraints. We propose parametric ways of systematically deriving glue constraints, which are a particular kind of implied constraints, as well as aggregation bounds that can be added to the decomposition of time-series constraints [5]. We evaluate the beneficial propagation impact of the derived implied constraints and bounds, both alone and together.
|
|
| 4. |
|
|
| 5. |
- Beldiceanu, Nicolas, et al.
(författare)
-
A Modelling Pearl with Sortedness Constraints
- 2015. - 9
-
Ingår i: GCAI 2015. Global Conference on Artificial Intelligence. - : EasyChair. ; , s. 27-41
-
Konferensbidrag (refereegranskat)abstract
- Some constraint programming solvers and constraint modelling languages feature the Sort(L,P,S) constraint, which holds if S is a nondecreasing rearrangement of the list L, the permutation being made explicit by the optional list P. However, such sortedness constraints do not seem to be used much in practice. We argue that reasons for this neglect are that it is impossible to require the underlying sort to be stable, so that Sort cannot be guaranteed to be a total-function constraint, and that L cannot contain tuples of variables, some of which form the key for the sort. To overcome these limitations, we introduce the StableKeysort constraint, decompose it using existing constraints, and propose a propagator. This new constraint enables a powerful modelling idiom, which we illustrate by elegant and scalable models of two problems that are otherwise hard to encode as constraint programs.
|
|
| 6. |
|
|
| 7. |
- Beldiceanu, Nicolas, et al.
(författare)
-
On the Reification of Global Constraints (Abstract)
- 2015
-
Ingår i: Principles and practice of constraint programming, CP 2015. - : SPRINGER-VERLAG BERLIN. - 9783319232195 - 9783319232188 ; , s. 733-733
-
Konferensbidrag (refereegranskat)
|
|
| 8. |
- Beldiceanu, Nicolas, et al.
(författare)
-
Range-consistent forbidden regions of Allen's relations
- 2016. - 10
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- For all 8192 combinations of Allen's 13 relations between one task with origin oi and fixed length li and another task with origin oj and fixed length lj, we give a formula F(min(oj), max(oj), li, lj), where min(oj) and max(oj) respectively denote the earliest and the latest origin of task j, evaluating to a set of integers which are infeasible for oi for the given combination. Such forbidden regions are useful e.g. in a range-consistency maintaining propagator for an Allen constraint in finite domain constraint programming.
|
|
| 9. |
- Beldiceanu, Nicolas, et al.
(författare)
-
Range-consistent forbidden regions of allen’s relations
- 2017
-
Konferensbidrag (refereegranskat)abstract
- For all 8192 combinations of Allen’s 13 relations between one task with origin oi and fixed length ℓi and another task with origin oj and fixed length ℓj, this paper shows how to systematically derive a formula F (oj, oj, ℓi, ℓj), where oj and oj respectively denote the earliest and the latest origin of task j, evaluating to a set of integers which are infeasible for oi for the given combination. Such forbidden regions allow maintaining range-consistency for an Allen constraint.
|
|
| 10. |
- Beldiceanu, Nicolas, et al.
(författare)
-
Using finite transducers for describing and synthesising structural time-series constraints
- 2015. - 5
-
Ingår i: Constraints. - : Springer. - 1383-7133 .- 1572-9354. ; 21:1, s. 22-40
-
Tidskriftsartikel (refereegranskat)abstract
- We describe a large family of constraints for structural time series by means of function composition. These constraints are on aggregations of features of patterns that occur in a time series, such as the number of its peaks, or the range of its steepest ascent. The patterns and features are usually linked to physical properties of the time series generator, which are important to capture in a constraint model of the system, i.e. a conjunction of constraints that produces similar time series. We formalise the patterns using finite transducers, whose output alphabet corresponds to semantic values that precisely describe the steps for identifying the occurrences of a pattern. Based on that description, we automatically synthesise automata with accumulators, as well as constraint checkers. The description scheme not only unifies the structure of the existing 30 time-series constraints in the Global Constraint Catalogue, but also leads to over 600 new constraints, with more than 100,000 lines of synthesised code.
|
|
| 11. |
- Letort, Arnaud, et al.
(författare)
-
Synchronized sweep algorithms for scalable scheduling constraints
- 2015. - 4
-
Ingår i: Constraints. - : Springer. - 1383-7133 .- 1572-9354. ; 19, s. 183-234
-
Tidskriftsartikel (refereegranskat)abstract
- This paper introduces a family of synchronized sweep-based filtering algorithms for handling scheduling problems involving resource and precedence constraints. The key idea is to filter all constraints of a scheduling problem in a synchronized way in order to scale better. In addition to normal filtering mode, the algorithms can run in greedy mode, in which case they perform a greedy assignment of start and end times. The filtering mode achieves a significant speed-up over the decomposition into independent CUMULATIVE and precedence constraints, while the greedy mode can handle up to 1 million tasks with 64 resource constraints and 2 million precedences. These algorithms were implemented in both CHOCO and SICStus.
|
|
| 12. |
|
|
