the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

Supplier selection and material procurement planning are the most important issues in supply chain management. This decision is complicated when the buyers face with discount price schemes. In real situation, each supplier may apply different methods such as different types of discount schedules and various types of payment in order to increase market share. In this situation, buyers try to sel...

In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...

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...

We present a constraint-based approach to interactive product configuration. Our configurator tool FdConfig is based on feature models for the representation of the product domain. Such models can be directly mapped into constraint satisfaction problems and dealt with by appropriate constraint solvers. During the interactive configuration process the user generates new constraints as a result o...

Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. requires an operational semantic model suitable for model checking. In this paper we introduce c...

Discovering significant itemsets is one of the fundamental tasks in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining tasks. With a constraint programming approach, we can easily express and efficiently answer queries with user’s constraints on itemsets. However, in many practical cases queries also involve user’s constraints on the data...

We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for these logics L as each ranges over models A, in the spirit of the dichotomy conjecture for the Constraint Satisfaction Problem – which itself may be seen as...

Views are a standard abstraction in constraint programming: They make it possible to implement a single version of each constraint, while avoiding to create new variables and constraints that would slow down propagation. Traditional constraint-programming systems provide the concept of variable views which implement a view of the type y = f(x) by delegating all (domain and constraint) operation...