Constraint Satisfaction and Computational Search

This research area studies constraint satisfaction, optimization, and computational search through the lens of Coherence Geometry. Instead of treating search only as discrete enumeration, CG represents constraints as coherence pressures or compatibility relations whose refinement can organize a system toward stable assignments, residual defects, or structured solution regions.

This area includes SAT/3SAT work, coherence relaxation methods, defect localization, and related computational approaches to hard combinatorial problems.

Publication List