Papers
Topics
Authors
Recent
Search
2000 character limit reached

The VLSAT-1 Benchmark Suite

Published 19 Nov 2020 in cs.DS and cs.FL | (2011.11049v1)

Abstract: This report presents VLSAT-1 (an acronym for "Very Large Boolean SATisfiability problems"), the first part of a benchmark suite to be used in scientificexperiments and software competitions addressing SAT-solving issues.VLSAT-1 contains 100~benchmarks of increasing complexity, proposed in DIMACSCNF format under a permissive Creative Commons license. These benchmarks havebeen used by the 2020 International Competition on Model Counting.

Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Pierre Bouvier 
  2. Hubert Garavel 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up