Problems involving resource allocation such as appointment taking or timetable creation have usually been tackled as constraint satisfaction problems. For the two aforementioned applications, this forces the users to reveal their agenda in order to give their constraints. But one doesn’t always want to reveal his private events. Thus a solution is for the users to keep their agenda private and ...

It was shown that constraint satisfaction problems (CSPs) with a low width can be solved effectively by structural methods. In particular, the BTD method which exploits the concepts of goods and nogoods makes it possible to solve efficiently difficult instances. However, the memory space required for the storage of these (no)goods may make difficult or impossible the resolution of certain probl...

This paper investigates how linguistic expressions of time, in particular temporal adverbs and verb tense morphemes, are used to establish temporal reference at the level of brain physiology. First, a formal semantic analysis of tense and temporal adverbs is outlined. It is argued that computing temporal reference amounts to solving a constraint satisfaction problem. Next, the results of an eve...

this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

The job-shop is a classical problem in manufacturing, arising daily in factories and workshops. From an AI perspective, the job-shop is a constraint satisfaction problem (CSP), and many specific techniques have been developed to solve it efficiently. In this context, one may believe that generic search and CSP methods (which typically are better understood and easier to develop, codify and main...

This paper describes a scheduling system to fullll the timetabling needs of the Computer Science program at Florida Institute of Technology. The system handles both general constraints of timetabling problems and constraints speciic to our problem. It has the exibility of allowing for either manual or automatic assignments. The scheduling process is split into two phases; each phase is modeled ...

This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tasks with variable duration and heights. The resource function is no more constant but is a positive or negative piecewise linear function of time. Finally, a task is no more pre-assigned to one resource, but to a task corresponds...

Particular problem in the management of distributed systems is the optimal resource allocation among the subsystems. When several subsystems of the distributed system use or compete for the use of a common resource, the limited capacity of the resource can give rise to constraint system behavior. Respectively, the fast solution of the resource problems strongly influences the application area o...

The CO4 language is a Haskell-like language for specifying constraint systems over structured finite domains. A CO4 constraint system is solved by an automatic transformation into a satisfiability problem in propositional logic that is handed to an external SAT solver. We investigate the problem of predicting the size of formulas produced by the CO4 compiler. The goal is to help the programmer ...

We introduce the automatic recording constraint (ARC) that can be used to model and solve scheduling problems where tasks may not overlap in time and the tasks linearly exhaust some resource. Since achieving generalized arc-consistency for the ARC is NP-hard, we develop a filtering algorithm that achieves approximated consistency only. Numerical results show the benefits of the new constraint o...