Precise constraint satisfaction modeling requires specific knowledge acquired from multiple past cases. We address this issue with a general branch-and-bound algorithm that learns the parameters of a given global constraint from a small set of positive solutions. The idea is to cleverly explore the possible combinations taken by the constraint’s parameters without explicitly enumerating all com...

background: selection of an appropriate leadership style coordinated with external motivation can improve job performance, job promotion and job satisfaction and consequently lead to achieving both individual and organizational goals. the aim of this study was to assess the relationship between leadership style and job satisfaction of staff working in health care networks in kerman university o...

This paper proposes a set approach for the simultaneous localization and mapping (SLAM) in a submarine context. It shows that this problem can be cast into a constraint satisfaction problem which can be solve efficiently using interval analysis and propagation algorithms. The efficiency of the resulting propagation method is illustrated on the localization of submarine robot, named Redermor. Th...

Real world planning applications typically involve making decisions that consumes limited resources, which requires both planning and scheduling. In this paper we propose a new approach that bridges the gap between planning and scheduling by explicitly modeling the problem in terms of resources, state variables and actions. We show that it is an intuitive way to formulate real world problems wi...

We present a brief survey of some of the key results on the interplay between algebraic and graph-theoretic methods in the study of the complexity of digraph-based constraint satisfaction problems. 1998 ACM Subject Classification A.1 Introductory and Survey, D.3.2 Constraint and Logic Languages, F.2.2 Computations on Discrete Structures

In this paper, an airport departure scheduling tool for aircraft is presented based on constraint satisfaction techniques. Airports are getting more and more congested with the available runway configuration as one of the most constraining factors. A possibility to alleviate this congestion is to assist controllers in the planning and scheduling process of aircraft. The prototype presented here...

As a first attempt to exploit symmetries in continuous constraint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cu...

The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In this paper, we introduce and study a new model for investigating QCSP complexity in which the types of constraints given by the existentially quantified varia...

I present a survey of recent advances in the algorithmic and computational complexity theory of non-Boolean Quantified Constraint Satisfaction Problems, incorporating some more modern research directions. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems

For a digraph H, the Constraint Satisfaction Problem with template H, or CSP(H), is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi states that for any digraph H, CSP(H) is either in P or NP-complete. Barto, Kozik, Maróti and Niven (Proc. Amer. Math. Soc, 2009) confirmed the conjecture for a class of oriented tr...