A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems tend to be over-constrained, and the descriptive power of the CSP is not always sufficient in formulating the problems because of various constraints involved. In this paper, we will focus on an important subclass of di...

We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulas for different restricted classes of formulas. It turns out that for each class from our framework, these problems are either polynomial time solvable or complete for OptP. We also consider the problem of deciding if in the optimal assignment the largest variable gets va...

We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (SCSPs), we define constraint hierarchy k-consistency (CH-k-C) and give a CH-2-C enforcement algorithm. We demonstrate how the CH-2-C algorithm can be seamlessly integrated into the...

The paper presents a novel modelling technique for system-level fault diagnosis in massive parallel multiprocessors, based on a re-formulation of the problem of syndrome decoding to a constraint satisfaction problem (CSP). The CSP based approach is able to handle detailed and inhomogeneous functional fault models to a similar depth as the Russel-Kime model [18]. Multiple-valued logic is used to...

the purpose of this research study is to check the overall job satisfaction associate with demographic factors: gender, age, ethnicity, civil status, experience, educational qualification, bank types and distance to working place in ampara region, sri lanka government and private bank employees. overall job satisfaction can be measured through the ability utilization, motivation, social status,...

objectives: this study aims to assess the relationship between the frequency of aggressive behaviors, life satisfaction (ls) and self- rated health (srh) and counseling with family members in a representative sample of iranian children and adolescents. methods: in this nationwide study, 14880 school students, aged 6-18 years, wereselected by cluster and stratified multi-stage sampling method fr...

Heribert Vollmer : Boolean functions and Post’s lattice with applications to complexity theory. A Boolean functions f can be obtained from a set B of Boolean functions by superposition, if f can be written as a nested composition of functions from B. In the 1940’s, Emil Post determined the complete list of all sets of Boolean functions closed under superposition, and for each of them, he constr...

For a fixed digraphH, the problem of deciding whether there exists a homomorphism from an input digraph G to H is known as the H-colouring problem. An algebraic approach to this problem was pioneered by Jeavons et. al. in the context of the more general constraint satisfaction problem. Results by Larose and Zádori and by Maróti and McKenzie allows one to interpret the algebraic approach in term...

We investigate the computational complexity of the problem of counting the locally maximal satisfying assignments of a Constraint Satisfaction Problem (CSP) over the Boolean domain {0, 1}. A satisfying assignment is locally maximal if any new assignment which is obtained from it by changing a 0 to a 1 is unsatisfying. For each constraint language Γ, #LocalMaxCSP(Γ) denotes the problem of counti...

Knowledge of the security zone classification of devices in an enterprise information technology (IT) infrastructure is essential in many enterprise IT transformation and optimization activities. We describe a systematic and semi-automated approach for discovering the security zone classification of devices in an enterprise network. For reduced interference with normal operation of the IT infra...