Abstract. Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (e.g., configuration and information...
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...