Many practical problems involve constraints in 0-1 variables. We apply the constraint logic programming language CLP(PB) to model and reason about 0-1 problems. Given a set of possibly non-linear 0-1 constraints, the solver of CLP(PB) computes an equivalent set of extended clauses. By exploiting the metaprogramming facilities of the logic programming environment, we are able to deal with arbitr...

This paper introduces an extension of Answer Set Programming called Preference Set Constraint Programming which is a convenient and general formalism to reason with preferences. PSC programming extends Set Constraint Programming introduced by Marek and Remmel (Marek and Remmel 2004) by introducing two types of preference set constraint atoms, measure preference set constraint atoms and pre-orde...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs and modules, while maintaining the capabilities of performing the usual coercions between constraint domains, and of typing meta-programming predicates...

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