Generating hard SAT/CSP instances using expander graphs

Authors:
Carlos Ansótegui;Ramón Béjar;Cèsar Fernández;Carles Mateu
Affiliations:
Dept. of Computer Science, Universitat de Lleida, Spain;Dept. of Computer Science, Universitat de Lleida, Spain;Dept. of Computer Science, Universitat de Lleida, Spain;Dept. of Computer Science, Universitat de Lleida, Spain
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Year:
2008

Citing 3
Cited 2

On sufficient conditions for unsatisfiability of random formulas

Journal of the ACM (JACM)
Regular Random k-SAT: Properties of Balanced Formulas

Journal of Automated Reasoning
Further investigations into regular XORSAT

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2

An improved satisfiable SAT generator based on random subgraph isomorphism

Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Automated testing and debugging of SAT and QBF solvers

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.