In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universalalgebraic ideas. We give applications illustrating the use of our technique.

Several real-world applications (e.g., scheduling, configuration, ... ) can be formulated as Constraint Satisfaction Problems (CSP). In these cases, a set of variables have to be settled to a value with the requirement that they satisfy a set of constraints. Classical CSPs are defined only by means of crisp (Boolean) constraints. However, as sometimes Boolean constraints are too strict in relat...

This paper describes general approaches to solving two classes of problems using the DISCO constraint database system. The rst class of problems occurs when distinct values from a subset of the integers must be assigned to the variables of a constraint satisfaction problem. The second occurs when a group of items must be selected from a subset of the integers such that each of a set of constrai...

aphasia is prevalent in people following stroke, which can have a significant impact on the quality of life of the patients with stroke. one of the new methods for treatment of patients with aphasia is constraint‑induced aphasia therapy (ciat). the aim of this study was to investigate the efficacy of ciat on naming deficits in individuals with chronic aphasia. this study had a prospective, sing...

background: constraint induced movement therapy is one of the new therapeutic interventions that limits the performance of intact upper limb with increased use of the affected limb. aim of this study was to investigate the effects of  modified constraint induced movement therapy on weight bearing & protective extension in children with hemiplegic cerebral palsy. methods: 21 hemiplegic children ...