# smt

Published articles for smt.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Proofs and Essays Are Paths: An LLM ↔ Prover Loop for Falsifying Hallucinations

DevFeed: [Proofs and Essays Are Paths: An LLM ↔ Prover Loop for Falsifying Hallucinations](<https://devfeed.tech/articles/proofs-and-essays-are-paths-an-llm-prover-loop-for-falsifying-hallucinations-40135.md>)

Original publisher: [Read original article](<https://korbonits.com/blog/2026-04-30-proofs-and-essays-are-paths/>)

Published: 2026-04-30T00:00:00Z

Content type: opinion

Language: en

Sources: [Alex Korbonits](<https://devfeed.tech/sources/alex-korbonits.md>)

Topics: [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Automated reasoning](<https://devfeed.tech/topics/automated-reasoning.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>)

Tags: [grounding](<https://devfeed.tech/tags/grounding.md>), [hallucinations](<https://devfeed.tech/tags/hallucinations.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [llm](<https://devfeed.tech/tags/llm.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [smt](<https://devfeed.tech/tags/smt.md>), [verification](<https://devfeed.tech/tags/verification.md>), [verify](<https://devfeed.tech/tags/verify.md>)

### AI overview

This essay proposes a bidirectional loop between a large language model and a theorem prover. LLM outputs become propositions and graph connections that the prover checks, while verification results feed back into the model. In this framework, hallucinations appear as knowledge-graph paths with edges that fail formal verification.

### Source excerpt

If a proof is a path through a formal space and an essay is a path through a semantic one, can we close the loop -- translate LLM outputs into a theorem prover, build a knowledge graph of verifiable propositions, and use the gaps as a signal for hallucination? Notebook ideas from March 2024 expanding on the SMT-grounding piece.

## Optimization Models for Subset Cover

DevFeed: [Optimization Models for Subset Cover](<https://devfeed.tech/articles/optimization-models-for-subset-cover-40441.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2020/10/20/optimization-models-for-subset-cover/>)

Published: 2020-10-20T09:00:00Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Optimization](<https://devfeed.tech/topics/optimization.md>), [Code](<https://devfeed.tech/topics/code.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [article](<https://devfeed.tech/tags/article.md>), [boolean-satisfiability](<https://devfeed.tech/tags/boolean-satisfiability.md>), [combinatorics](<https://devfeed.tech/tags/combinatorics.md>), [integer-programming](<https://devfeed.tech/tags/integer-programming.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [smt](<https://devfeed.tech/tags/smt.md>), [source](<https://devfeed.tech/tags/source.md>), [subset-cover](<https://devfeed.tech/tags/subset-cover.md>), [z3](<https://devfeed.tech/tags/z3.md>)

### AI overview

This article explores subset covering as a combinatorial optimization problem and compares Integer Linear Programming solvers with Z3, an open-source SMT solver from Microsoft. It defines a generalized formulation for covering all subsets of size l with the fewest subsets of size k.

### Source excerpt

In a recent newsletter article I complained about how researchers mislead about the applicability of their work. I gave SAT solvers as an example. People provided interesting examples in response, but what was new to me was the concept of SMT (Satisfiability Modulo Theories), an extension to SAT. SMT seems to have more practical uses than vanilla SAT (see the newsletter for details). I wanted to take some time to explore SMT solvers, and I landed on Z3, an open-source SMT solver from Microsoft.