Skip to content

Source code and benchmark suites for our paper 'Conflict-Driven SAT Solving Using XOR-OR-AND Normal Forms'

License

Notifications You must be signed in to change notification settings

j-danner/Xorricane-paper

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Conflict-Driven SAT Solving Using XOR-OR-AND Normal Forms

This repository contains the source code for the conflict-driven XNF SAT solver Xorricane as well as the benchmark suites presented in

J.Danner, M.Kreuzer, Conflict-Driven SAT Solving Using XOR-OR-AND Normal Forms, submitted, 2025.


Xorricane

The conflict-driven XNF SAT Solving Algorithm, CDXCL-lite (Algorithm 6), is implemented in C++ by J. Danner in the submodule Xorricane. It uses the data structures and most optimizations introduced in Section 5.2. Details on heuristics and command line options can be found in Appendix A.

Setup

Run git submodule update --init to clone the submodule. Instructions to run and build the solver can be found in the respective subfolder.

Benchmark Suites

The random and cryptographic benchmark suites used in Section 6 are available under the Releases section.


Related Tools / Solvers

  • Conversion tool from ANF to XNF, anf_to_2xnf; used for benchmark creation.
  • Graph-based DPLL-SAT 2-XNF solver, 2-Xornado; used as preprocessor in Xorricane.

About

Source code and benchmark suites for our paper 'Conflict-Driven SAT Solving Using XOR-OR-AND Normal Forms'

Topics

Resources

License

Stars

Watchers

Forks