Recent searches

No recent searches

Search options

Only available when logged in.
sigmoid.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A social space for people researching, working with, or just interested in AI!

Administered by:

Server stats:

572
active users

sigmoid.social: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.3

#satisfiability

0 posts0 participants0 posts today
Constraints Journal<p>Dear all,</p><p>📓 This is the official account of the Constraints Journal (<a href="https://link.springer.com/journal/10601" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">link.springer.com/journal/1060</span><span class="invisible">1</span></a>). </p><p>📣 We will use this account to notify you of new publications, extra materials, CfPs and special issues. </p><p>💬 We look forward to connecting with the CP community, and thank ACM for hosting.</p><p>🚀 Please boost, tnx!<br> <br><a href="https://mastodon.acm.org/tags/AcademicMastodon" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AcademicMastodon</span></a><br><a href="https://mastodon.acm.org/tags/ArtificialIntelligence" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ArtificialIntelligence</span></a><br><a href="https://mastodon.acm.org/tags/AutomatedReasoning" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AutomatedReasoning</span></a><br><a href="https://mastodon.acm.org/tags/CombinatorialAlgorithms" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CombinatorialAlgorithms</span></a><br><a href="https://mastodon.acm.org/tags/ComputationalLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalLogic</span></a><br><a href="https://mastodon.acm.org/tags/ConstraintProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ConstraintProgramming</span></a><br><a href="https://mastodon.acm.org/tags/OperationsResearch" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>OperationsResearch</span></a><br><a href="https://mastodon.acm.org/tags/Optimisation" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Optimisation</span></a><br><a href="https://mastodon.acm.org/tags/Satisfiability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Satisfiability</span></a></p>
JMLR<p>&#39;Critically Assessing the State of the Art in Neural Network Verification&#39;, by Matthias König, Annelot W. Bosman, Holger H. Hoos, Jan N. van Rijn.</p><p><a href="http://jmlr.org/papers/v25/23-0119.html" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">http://</span><span class="ellipsis">jmlr.org/papers/v25/23-0119.ht</span><span class="invisible">ml</span></a> <br /> <br /><a href="https://sigmoid.social/tags/robustness" class="mention hashtag" rel="tag">#<span>robustness</span></a> <a href="https://sigmoid.social/tags/benchmarks" class="mention hashtag" rel="tag">#<span>benchmarks</span></a> <a href="https://sigmoid.social/tags/satisfiability" class="mention hashtag" rel="tag">#<span>satisfiability</span></a></p>
Mark Gritter<p>Weekend project: try to solve some <a href="https://mathstodon.xyz/tags/combinatorics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>combinatorics</span></a> <a href="https://mathstodon.xyz/tags/enumeration" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>enumeration</span></a> problems by reduction to <a href="https://mathstodon.xyz/tags/SharpSAT" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>SharpSAT</span></a>. (Which, to be clear, I thought was unlikely to succeed!)</p><p>I picked c2d <a href="http://reasoning.cs.ucla.edu/c2d/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">http://</span><span class="">reasoning.cs.ucla.edu/c2d/</span><span class="invisible"></span></a> because it scored highly in the 2020 Model Counting Competition <a href="https://arxiv.org/abs/2012.01323" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">arxiv.org/abs/2012.01323</span><span class="invisible"></span></a> but I am not sure this is the same version. The one I got is dated 2005 and was 32-bit only. It ran out of memory on this 364-variable 942-clause instance (corresponding to 6 playing cards chosen from a standard 52-card deck.)</p><p>Looking at the 2023 competition instead, I think I should try SharpSAT-TD <a href="https://github.com/Laakeri/sharpsat-td" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">github.com/Laakeri/sharpsat-td</span><span class="invisible"></span></a> but it is not as well documented. For example, I don't know if it supports the "eclauses" (exactly-one clauses) extension of the Dimacs CNF format.</p><p><a href="https://mathstodon.xyz/tags/Satisfiability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Satisfiability</span></a></p>
TrendingLive feeds
About