This paper describes a model for temporal reasoning that handles both quantitative and qualitative information affected by vagueness and uncertainty. Starting from two existing models, namely the Meiri’s system [9] and IA fuz [2, 3], the proposed approach generalizes the first to a fuzzy framework and extends the second in order to handle qualitative constraints. The system uses the Fuzzy Const...

For a large number of random Boolean constraint satisfaction problems, such as random k-SAT, we study how the number of locally maximal solutions evolves when constraints are added. We give the exponential order of the expected number of these distinguished solutions and prove it depends on the sensitivity of the allowed constraint functions only. As a by-product we provide a general tool for c...

A distributed MPC approach for linear uncertain systems sharing convex constraints is presented. The systems, which are dynamically decoupled but share constraints on state and/or inputs, optimize once, in parallel, at each time step and exchange plans with neighbours thereafter. Coupled constraint satisfaction is guaranteed, despite the simultaneous decision making, by extra constraint tighten...

Bang-Jensen and Hell conjectured in 1990 (using the language of graph homomorphisms) a CSP dichotomy for digraphs with no sources or sinks. The conjecture states that the constraint satisfaction problem for such a digraph is tractable if each component of its core is a circle and is NP-complete otherwise. In this paper we prove this conjecture, and, as a consequence, a conjecture of Bang-Jensen...

Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction programming is used in predicting the path loss of various indoor propagation models using chronological ba...

The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of service composition have been recently made. We present an approach, based on modelling the problem as a CSP (Constraint Satisfaction Problem), that accommodates for the use of numeric variables, sensing and incomplete ...

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