In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...

The idea of synthesizing bounded length plans by compiling planning problems into a combinatorial substrate, and solving the resulting encodings has become quite popular in recent years. Most work to-date has however concentrated on compilation to satis ability (SAT) theories and integer linear programming (ILP). In this paper we will show that CSP is a better substrate for the compilation appr...

Circumsporozoite protein (CSP) is the dominant protein on the surface of Plasmodium sporozoites and plays a critical role in the invasion by sporozoites of hepatocytes. Contacts between CSP and heparin sulfate proteoglycans (HSPGs) lead to the attachment of sporozoites to hepatocytes and trigger signaling events in the parasite that promote invasion of hepatocytes. The precise sequence elements...

Arc consistency and generalized arc consistency are two of the most important local consistency techniques for binary and non-binary classic constraint satisfaction problems (CSPs). Based on the Semiring CSP and Valued CSP frameworks, arc consistency has also been extended to handle soft constraint satisfaction problems such as fuzzy CSP, probabilistic CSP, max CSP, and weighted CSP. This exten...

Constraint programming is gaining a great deal of attention because many combinatorial problems especially in areas of planning and scheduling can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a non-binary CSP can be transformed into an equivalent binary CSP using some of the actual techniques. However, when the CSP is not discrete or the number...

The extraction of a Minimal Unsatisfiable Core (MUC) in a Constraint Satisfaction Problem (CSP) aims to identify a subset of constraints that make a CSP instance unsatisfiable. Recent work has addressed the identification of a Minimal Set of Unsatisfiable Tuples (MUST) in order to restore the CSP satisfiability with respect to that MUC. A two-step algorithm has been proposed: first, a MUC is id...

Given a fixed constraint language Γ , the conservative CSP over Γ (denoted by c-CSP(Γ )) is a variant of CSP(Γ ) where the domain of each variable can be restricted arbitrarily. In [5] a dichotomy has been proven for conservative CSP: for every fixed language Γ , c-CSP(Γ ) is either in P or NP-complete. However, the characterization of conservatively tractable languages is of algebraic nature a...

Microcrystalline Tyrosine (MCT®) is a widely used proprietary depot excipient in specific immunotherapy for allergy. In the current study we assessed the potential of MCT to serve as an adjuvant in the development of a vaccine against malaria. To this end, we formulated the circumsporozoite protein (CSP) of P. vivax in MCT and compared the induced immune responses to CSP formulated in PBS or Al...

In this study, a novel regularized common spatial pattern method is introduced. Spatial filtering is an important processing step for feature extraction in motor imagery based brain computer interfaces. Common Spatial Patterns (CSP) method is an effective spatial filter for discriminating different motor imagery signals acquired using large number of EEG electrodes. Unfortunately, CSP method is...

This paper investigates the influence of organizations’ board independence on corporate social performance (CSP) using a meta-analytic approach. A sample of 87 published papers is used to identify a set of underlying moderating effects in that relationship. Specifically, differences in the system of corporate governance, CSP measurement models and market conditions have been considered as moder...