<div class="csl-bib-body">
<div class="csl-entry">Szeider, S. (2025). Bridging Language Models and Symbolic Solvers via the Model Context Protocol. In J. Berg & J. Nordström (Eds.), <i>28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)</i>. Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.SAT.2025.30</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/225646
-
dc.description.abstract
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.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Leibniz International Proceedings in Informatics (LIPIcs)
-
dc.subject
Agents
en
dc.subject
Constraint Programming
en
dc.subject
Large Language Models
en
dc.subject
Maximum Satisfiability
en
dc.subject
Model Context Protocol
en
dc.subject
SAT Modulo Theories
en
dc.subject
Satisfiability Solvers
en
dc.title
Bridging Language Models and Symbolic Solvers via the Model Context Protocol
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.editoraffiliation
University of Helsinki, Finland
-
dc.contributor.editoraffiliation
University of Copenhagen, Denmark
-
dc.relation.isbn
978-3-95977-381-2
-
dc.type.category
Full-Paper Contribution
-
dc.relation.eissn
1868-8969
-
tuw.booktitle
28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)
-
tuw.container.volume
341
-
tuw.peerreviewed
true
-
tuw.relation.publisher
Schloss Dagstuhl
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publication.orgunit
E056-13 - Fachbereich LogiCS
-
tuw.publication.orgunit
E056-23 - Fachbereich Innovative Combinations and Applications of AI and ML (iCAIML)
-
tuw.publisher.doi
10.4230/LIPIcs.SAT.2025.30
-
dc.description.numberOfPages
12
-
tuw.author.orcid
0000-0001-8994-1656
-
tuw.editor.orcid
0000-0001-7660-8061
-
tuw.event.name
28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)
en
tuw.event.startdate
12-08-2025
-
tuw.event.enddate
15-08-2025
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Glasgow
-
tuw.event.country
GB
-
tuw.event.presenter
Szeider, Stefan
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.fulltext
no Fulltext
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.openairetype
conference paper
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity