Creative Commons Attribution 4.0 International license
This paper presents the MCP Solver, a system that bridges large language models with symbolic solvers through the Model Context Protocol (MCP). The system includes a server and a client component. The server provides an interface to constraint programming (via MiniZinc Python), propositional satisfiability and maximum satisfiability (both via PySAT), and SAT modulo Theories (via Python Z3). The client contains an agent that connects to the server via MCP and uses a language model to autonomously translate problem statements (given in English) into encodings through an incremental editing process and runs the solver. Our experiments demonstrate that this neurosymbolic integration effectively combines the natural language understanding of language models with robust solving capabilities across multiple solving paradigms.
@InProceedings{szeider:LIPIcs.SAT.2025.30,
author = {Szeider, Stefan},
title = {{Bridging Language Models and Symbolic Solvers via the Model Context Protocol}},
booktitle = {28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)},
pages = {30:1--30:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-381-2},
ISSN = {1868-8969},
year = {2025},
volume = {341},
editor = {Berg, Jeremias and Nordstr\"{o}m, Jakob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.30},
URN = {urn:nbn:de:0030-drops-237649},
doi = {10.4230/LIPIcs.SAT.2025.30},
annote = {Keywords: Large Language Models, Agents, Constraint Programming, Satisfiability Solvers, Maximum Satisfiability, SAT Modulo Theories, Model Context Protocol}
}