We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge decomposition and hypertree decomposition. Our experiments show that one of our techniques offers the best trade-off between the computational cost of the decomposition and the width of the resulting decomposition tree.

Valued constraint satisfaction problem (VCSP) is an optimisation framework originally coming from Artificial Intelligence and generalising the classical constraint satisfaction problem (CSP). The VCSP is powerful enough to describe many important classes of problems. In order to investigate the complexity and expressive power of valued constraints, a number of algebraic tools have been develope...

In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterised in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of de...

This article aims to determine the extent which job satisfaction and justice at work influence turnover intention of public transport workers. The power predict was studied in employees a transportation company Corumbá, Brazil, measured using following validated instruments: Scale Job Satisfaction, Perception Distributive Justice, Procedural Justice Turnover Intention Scale. reports quantitativ...

For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...

While finishing this paper I found the paper [9] which proves that a binary operation that is generates a minimal clone is NP-complete is the operation is non-commutative and is polynomial if the operation is equivalent to a commutative operation that generates the clone. From this result all results in this paper can be (even more) trivially proved. This paper might be of interest to some read...

The problems that deserve an attack demonstrate it by a counterattack. Abstract Andr eka and Maddux (1994, Notre Dame Journal of Formal Logic, 35(4)) classiied the small relation algebras | those with at most 8 elements, or in other terms, at most 3 atomic relations. They showed that there are eighteen isomorphism types of small relation algebras, all representable. For each simple, small relat...

The literature provides several structural decomposition methods for identifying tractable subclasses of the constraint satisfaction problem. Generalized hypertree decomposition is the most general of such decomposition methods. Although the relationship to other structural decomposition methods has been thoroughly investigated, only little research has been done on efficient algorithms for com...

Constraint satisfaction is one of the major areas in AI that has important real-life applications. Lee et al. propose E-GENET, a stochastic solver for general constraint solving based on iterative repair. Performance figures show that E-GENET compares favorably against tree-search based solvers in many hard problems. On the other hand, global constraints have been shown to be very effective in ...