Multi-Agent Systems (MAS) are an efficient approach to deal with distributed complex problems. However, they are slightly suited to optimization ones. In order to tackle this problem we present a model to specify Multi-Agent Systems with the Constraint Satisfaction Problem (CSP) formalism. It allows to take advantages from CSP solving algorithms and to deal with optimization problems. For this ...

The k-sat problem is a prototypical constraint satisfaction problem. There are many algorithms to study k-sat problem, BP algorithm is famous one of them. But BP algorithm does not converge when α(constraint density)is bigger than some threshold value. In this paper we use CCCP (Concave Convex Procedure) algorithm to study 3-sat problem and we get better results than BP algorithm that CCCP algo...

Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The present paper strengthens this link. We study the problem of maximizing a supermodular function which is defined on a product of n copies of a fixed finite lattice and given by an oracle. We exhibit a large class of fini...

This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that may be used to assign weights to the configurations (feasible solutions) of a problem instance. Classical constraint satisfaction problems correspond to the ...

Temporal constraint satisfaction problem is a useful formalism for representing and reasoning about temporal occurrences and their temporal relationships. In this paper, we present a new temporal constraint satisfaction problem to deal with sequential patterns (STCSP). The problem is represented as a constraint satisfaction problem with sequential valuated variables, where multiple sequential v...

As (Lee and Leung 2012) have shown, weighted constraint satisfaction problems can benefit from the introduction of global cost functions, leading to a new Cost Function Programming paradigm. In this paper, we explore the possibility of decomposing global cost functions in such a way that enforcing soft local consistencies on the decomposition achieves the same level of consistency on the origin...

Casting planning as a satis ability problem has recently lead to the development of signi cantly faster planners. One key factor behind their success is the concise nature of the encodings of the planning problems. This has lead to an interest in designing schemes for automated generation of propositional encodings for the planning problems. These encodings are inspired by traditional planning ...

We present an algorithm for exact protein structure prediction in the FCC-HP-model. This model is a lattice protein model on the face-centered-cubic lattice that models the main force of protein folding, namely the hydrophobic force. The structure prediction for this model can be based on the construction of hydrophobic cores. The main focus of the paper is on an algorithm for constructing maxi...

In this paper, we reveal a relation between joint winner property (JWP) in the field of valued constraint satisfaction problems (VCSPs) and M-convexity in the field of discrete convex analysis (DCA). We introduce the M-convex completion problem, and show that a function f satisfying the JWP is Z-free if and only if a certain function f associated with f is M-convex completable. This means that ...