Generating Difficult SAT Instances by Preventing Triangles

03/08/2019
by   Guillaume Escamocher, et al.
0

When creating benchmarks for SAT solvers, we need SAT instances that are easy to build but hard to solve. A recent development in the search for such methods has led to the Balanced SAT algorithm, which can create k-SAT instances with m clauses of high difficulty, for arbitrary k and m. In this paper we introduce the No-Triangle SAT algorithm, a SAT instance generator based on the cluster coefficient graph statistic. We empirically compare the two algorithms by fixing the arity and the number of variables, but varying the number of clauses. The hardest instances that we find are produced by No-Triangle SAT. Furthermore, difficult instances from No-Triangle SAT have a different number of clauses than difficult instances from Balanced SAT, potentially allowing a combination of the two methods to find hard SAT instances for a larger array of parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2013

Extending Modern SAT Solvers for Enumerating All Models

In this paper, we address the problem of enumerating all models of a Boo...
research
09/07/2020

Collaborative Management of Benchmark Instances and their Attributes

Experimental evaluation is an integral part in the design process of alg...
research
08/04/2023

Solving Witness-type Triangle Puzzles Faster with an Automatically Learned Human-Explainable Predicate

Automatically solving puzzle instances in the game The Witness can guide...
research
09/13/2022

SATViz: Real-Time Visualization of Clausal Proofs

Visual layouts of graphs representing SAT instances can highlight the co...
research
05/09/2018

Revisiting Decision Diagrams for SAT

Symbolic variants of clause distribution using decision diagrams to elim...
research
09/18/2015

Backdoors into Heterogeneous Classes of SAT and CSP

In this paper we extend the classical notion of strong and weak backdoor...
research
12/04/2019

Prioritized Unit Propagation with Periodic Resetting is (Almost) All You Need for Random SAT Solving

We propose prioritized unit propagation with periodic resetting, which i...

Please sign up or login with your details

Forgot password? Click here to reset