fmtools/public
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

rebuild

Browse Source
This commit is contained in:
Landon Taylor
2025-06-13 15:05:28 -06:00
parent a43350989a
commit 5cfeefe269
158 changed files with 13647 additions and 339 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
maintenance/actively-maintained/index.xml
View File

@ -22,6 +22,13 @@
<guid>http://localhost:1313/tools/sat-smt/bitwuzla/</guid>
<description>&lt;p&gt;Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.&lt;/p&gt;</description>
</item>
<item>
<title>CaDiCaL</title>
<link>http://localhost:1313/tools/sat-smt/cadical/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/cadical/</guid>
<description>&lt;p&gt;CaDiCaL is a simplified satisfiability solver.&lt;/p&gt;</description>
</item>
<item>
<title>Colibri</title>
<link>http://localhost:1313/tools/sat-smt/colibri/</link>
@ -43,6 +50,13 @@
<guid>http://localhost:1313/tools/sat-smt/cvc5/</guid>
<description>&lt;p&gt;cvc5 is an automatic theorem prover for SMT problems.&lt;/p&gt;</description>
</item>
<item>
<title>E</title>
<link>http://localhost:1313/tools/sat-smt/e/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/e/</guid>
<description>&lt;p&gt;E is a theorem prover for full first-order logic (and now monomorphic higher-order logic) with equality.&lt;/p&gt;</description>
</item>
<item>
<title>Glucose</title>
<link>http://localhost:1313/tools/sat-smt/glucose/</link>
@ -127,6 +141,13 @@
<guid>http://localhost:1313/tools/sat-smt/stp/</guid>
<description>&lt;p&gt;STP is a constraint solver for quantifier-free bitvectors.&lt;/p&gt;&#xA;&lt;h2 id=&#34;apis-and-bindings&#34;&gt;APIs and Bindings&lt;/h2&gt;&#xA;&lt;p&gt;This tool is available through the following interfaces:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;C API:&lt;/strong&gt; &lt;a href=&#34;https://stp.readthedocs.io/en/latest/#c-library-usage&#34; target=&#34;_blank&#34; &gt;stp C API Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Python bindings:&lt;/strong&gt; &lt;a href=&#34;https://stp.readthedocs.io/en/latest/#python-usage&#34; target=&#34;_blank&#34; &gt;stp PyPI package&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
</item>
<item>
<title>Vampire</title>
<link>http://localhost:1313/tools/sat-smt/vampire/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/vampire/</guid>
<description>&lt;p&gt;Vampire is a theorem prover.&lt;/p&gt;</description>
</item>
<item>
<title>veriT</title>
<link>http://localhost:1313/tools/sat-smt/verit/</link>
@ -148,5 +169,12 @@
<guid>http://localhost:1313/tools/sat-smt/z3/</guid>
<description>&lt;p&gt;Z3 is a general-purpose theorem prover widely used for SAT &amp;amp; SMT solving.&lt;/p&gt;&#xA;&lt;h2 id=&#34;apis-and-bindings&#34;&gt;APIs and Bindings&lt;/h2&gt;&#xA;&lt;p&gt;This tool is available through the following interfaces:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;C API:&lt;/strong&gt; &lt;a href=&#34;https://z3prover.github.io/api/html/group__capi.html&#34; target=&#34;_blank&#34; &gt;Z3 C API Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;C++ API:&lt;/strong&gt; &lt;a href=&#34;https://z3prover.github.io/api/html/namespacez3.html&#34; target=&#34;_blank&#34; &gt;Z3 C++ Namespace Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;.NET API:&lt;/strong&gt; &lt;a href=&#34;https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html&#34; target=&#34;_blank&#34; &gt;Z3 .NET Namespace Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Java API:&lt;/strong&gt; &lt;a href=&#34;https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html&#34; target=&#34;_blank&#34; &gt;Z3 Java API Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Python bindings:&lt;/strong&gt; &lt;a href=&#34;https://pypi.org/project/z3-solver/&#34; target=&#34;_blank&#34; &gt;z3-solver PyPI package&lt;/a&gt; (&lt;a href=&#34;https://z3prover.github.io/api/html/z3.html&#34; target=&#34;_blank&#34; &gt;Documentation&lt;/a&gt;)&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Rust bindings:&lt;/strong&gt; &lt;a href=&#34;https://crates.io/crates/z3&#34; target=&#34;_blank&#34; &gt;z3 crate on crates.io&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
</item>
<item>
<title>Zipperposition</title>
<link>http://localhost:1313/tools/sat-smt/zipperposition/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/zipperposition/</guid>
<description>&lt;p&gt;Zipperposition is an automated theorem prover for first-order logic with equality and theories.&lt;/p&gt;</description>
</item>
</channel>
</rss>