This paper investigates several classical and novel variations of the Erdős--Szekeres problem, including multicolored point sets, convex hexagons with a given number of interior points, and polygons with constraints on edge colors. We propose a comprehensive computational framework combining combinatorial modeling within the SAT/ASP paradigms with the geometric realization of configurations. To determine point coordinates, we developed the \textbf{linear subreduction method}. The core idea consists of combining the complete logical model of the problem with a system of geometric inequalities, followed by fixing the abscissae to linearize the constraints. This approach enables a simultaneous search for a realization across the entire space of admissible abstract configurations (signotopes) rather than examining them individually, while linearization significantly accelerates the SMT solving process. Using this framework, we established new exact values for several functions; in particular, we proved $h_{nc}(4,0; 4,0)=26$: any bicolored set of 26 points in general position must contain the vertices of an empty monochromatic quadrilateral.