Question

Here's a problem that occurs in automatic program analysis. For a set of variables x1, x2, ..., In, you are given some equality constraints of the form "Xi = x;" and some disequality constraints of the form "r; # x;". Is it possible to satisfy all of them? For instance, the constraints Xi = x2, 22 = x3, x3 = 24, X1 + x4 cannot be satisfied. Give an efficient algorithm that takes as input m constraints over n variables and decides whether the constraints can be satisfied.

Answer 1

Question Here's a poroblem that occurs in d Set of and some form "xi 1= xj". automatic program analysis for variables x1, x2 ; ... ixn you are given Some Equailty contraints of the farm xi - = x;" disequality constorting of the Is it possibile to satisfy all of them? Given for the set of variables 21,x2, x3, x4, the Equality constraint is xi = xj where inequality constora int xi! = xj. below attachements provides the solution. Consider G=(VIE) Хи as for the let G be has a node following Gestaph and Variable corresponding to Everty an Edge (2;, *;) X1 and also

for constraint i = n; so to Equality implement the goraphi do Depth First Search (DPs) to find connected components - for each node ai, if it is ink th connected Component of the graphi then we mark k. it and resign for each inequality constraint xi &&; occur in * First ye check, if xi and xj connected component of G different * we Then Export that the cons boutints come unsatistiable unstatitiable else un

- In the above Equality constonaints problem, the Equilalance, class, form - If all will be that ai # xj the constraints satisfies then there inequality congtaint can not be satistiable , which leads ИО and this to Constia diction. all the constraints one satistiable, Correctly. he take that all then algorithem goes the constraints are - Now not satisfiable and when this happens only xi #ses where di ę dj lie in the same class. Suppose the above on is for all inequality constraints see tag where xi & ; die in different counaded components, not the case is