the aim of this study is to survey the relationship between total quality management and customer satisfaction. in this field research, we have used the standard questionnaire of fuentes et at (2004). the city of sanandaj is the statistical study of manufacturing companies and the statistical society, 135 managers and employees of the centers were randomly selected. in order to examining the re...

The paper summarizes research for generating explanations from environmental models. We make use of the corresponding representation of the environmental models as constraint satisfaction problems. We show how this representation can be used directly to derive explanations. During the whole paper we use a coarse model which represents the relationship between the ground-level ozone concentratio...

Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying variables. Experiments with constraint satisfaction problems (CSPs) using factor analysis suggest that for some (perhaps many) classes of problems, there are only a few distinct principles of heuristic action. In this p...

This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P )). We show that if the set of assignments accepted by P contains the support of a balanced pairwise independent distribution over the domain of the inputs, then such a problem on n variables cannot be approximated better than the trivial (random) approximation, even using Ω(n) levels ...

This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avoid unnecessary computation. The architecture used is a uniform model of computation, where each constraint contributes its local information to provide a global solution. We demonstrate the uti l i ty of the system by ...

A broken triangle is a pattern of (in)compatibilities between assignments in a binary CSP (constraint satisfaction problem). In the absence of certain broken triangles, satisfiability-preserving domain reductions are possible via merging of domain values. We investigate the possibility of maximising the number of domain reduction operations by the choice of the order in which they are applied, ...

Constraint satisfaction problems are widely used in artiicial intelligence. They involve nding values for problem variables subject to constraints that specify which combinations of values are consistent. Knowledge about properties of the constraints can permit inferences that reduce the cost of consistency checking. In particular, such inferences can be used to reduce the number of constraint ...

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational i...

Feature model validation aims to identify errors in feature models. The two major errors, called dead features and false variable features, are caused by contradictory feature relationships in a feature model. Current existing approaches use constraint satisfaction problem (CSP) and CSP solvers to identify these feature model errors. However, CSP is a NPcomplete problem and CSP solvers reveal a...