We integrate predicate constraints to stableKanren to enable a new problem-solving paradigm in combinatorial search problems. stableKanren extends miniKanren to reasoning about contradictions under stable model semantics. However, writing programs to solve combinatorial search problems in stableKanren did not fully utilize the contradiction reasoning. This is mainly due to the lack of control over the predicate (goal function) outcome during the resolution. Predicate constraints defined by answer set programming (ASP) provide the ability to constrain the predicate outcome. However, predicate constraints are headless normal clauses, and stableKanren can not create a goal function without a valid head. There are two approaches to handling predicate constraints, but they do not fit stableKanren. Therefore, we design a new approach to integrate predicate constraints into stableKanren. We show a uniform framework to solve combinatorial search problems using predicate constraints in extended stableKanren.