AI Chat AI Image Generator AI Video Text to Speech

The VLSAT-1 Benchmark Suite

11/19/2020

∙

by Pierre Bouvier, et al.

∙

∙

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.

Pierre Bouvier
3 publications
Hubert Garavel
6 publications

page 1

page 7

research

∙ 09/08/2021

The VLSAT-2 Benchmark Suite

This report presents VLSAT-2 (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

∙ 01/03/2017

Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation

OpenRuleBench is a large benchmark suite for rule engines, which include...

0 Stefan Brass, et al. ∙

research

∙ 09/14/2023

International Competition on Graph Counting Algorithms 2023

This paper reports on the details of the International Competition on Gr...

0 Takeru Inoue, 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

∙ 03/25/2019

On Evaluating the Renaissance Benchmarking Suite: Variety, Performance, and Complexity

The recently proposed Renaissance suite is composed of modern, real-worl...

0 Aleksandar Prokopec, 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. ∙