<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SEPIA: Search for Proofs Using Inferred Automata · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1505.07987/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1505.07987/feed.xml" rel="self" type="application/rss+xml" /><item><title>SEPIA: Search for Proofs Using Inferred Automata — mentioned by chriswarbo</title><link>https://news.ycombinator.com/item?id=18044302</link><guid isPermaLink="false">urn:hackerpapers:mention:1505.07987:18044302</guid><pubDate>Sat, 22 Sep 2018 03:30:29 GMT</pubDate><description>&lt;p&gt;Possibly this? http://www.macs.hw.ac.uk/~ek19/ML4PG/ It&amp;#x27;s mostly in maintenance mode (at least, I seem to have inherited its maintenance; and it&amp;#x27;s such a horrible mess of Emacs Lisp + Matlab + shell scripts that I don&amp;#x27;t dare touch it unless asked ;) ). It&amp;#x27;s used for clustering statements and proofs, the idea being that if you&amp;#x27;re stuck trying to prove something, you might be able to find something &amp;quot;similar&amp;quot; in an existing library to use as inspiration. It&amp;#x27;s mostly to help with manual searches, rather than automatically solving anything (although there is some related work on doing that for Coq…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1505.07987/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
