Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability
Researchers propose a hybrid reasoning system that combines Large Language Models with preference-based Maximum Satisfiability solvers to tackle complex optimization problems with multiple constraints. The approach achieves over 80% correctness rates on preference-based reasoning tasks, substantially outperforming traditional LLM baselines that rarely produce feasible solutions.