Abstract
We are dealing with the problem of enforcing certain level of consistency in Boolean satisfaction problems (SAT problems). As a starting point we took path-consistency which we made stronger by requiring a more restrictive condition on paths connecting consistent pairs of values.