AI Chat AI Image Generator AI Video Text to Speech

The VLSAT-2 Benchmark Suite

09/08/2021

∙

by Pierre Bouvier, et al.

∙

∙

This report presents VLSAT-2 (an acronym for "Very Large Boolean SATisfiability problems),the second part of a benchmark suite to be used in scientific experiments and softwarecompetitions addressing SAT-solving issues.VLSAT-2 contains 100 benchmarks (50 satisfiable and 50 unsatisfiable formulas)of increasing complexity, proposed in DIMACS CNF format undera permissive Creative Commons license.25 during the 2020 and 2021 editionsof the International SAT Competition.

Pierre Bouvier
3 publications
Hubert Garavel
6 publications

research

∙ 11/19/2020

The VLSAT-1 Benchmark Suite

This report presents VLSAT-1 (an acronym for "Very Large Boolean SATisfi...

0 Pierre Bouvier, et al. ∙

research

∙ 12/07/2021

The VLSAT-3 Benchmark Suite

This report presents VLSAT-3 (an acronym for "Very Large Boolean SATisfi...

0 Pierre Bouvier, et al. ∙

research

∙ 11/09/2009

Industrial-Strength Formally Certified SAT Solving

Boolean Satisfiability (SAT) solvers are now routinely used in the verif...

0 Ashish Darbari, et al. ∙

research

∙ 10/29/2019

G2SAT: Learning to Generate SAT Formulas

The Boolean Satisfiability (SAT) problem is the canonical NP-complete pr...

6 Jiaxuan You, et al. ∙

research

∙ 03/05/2023

SatIn: Hardware for Boolean Satisfiability Inference

This paper describes SatIn, a hardware accelerator for determining boole...

0 Chenzhuo Zhu, et al. ∙

research

∙ 03/17/2022

cRoK: A Composable Robotics Benchmark

Selecting an optimal robot and configuring it for a given task is curren...

0 Matthias Mayer, et al. ∙

research

∙ 09/21/2017

Satisfiability Modulo Theory based Methodology for Floorplanning in VLSI Circuits

This paper proposes a Satisfiability Modulo Theory based formulation for...

0 Suchandra Banerjee, et al. ∙