vedadux / nanoqbf

A minimal implementation of an expansion-based QBF solver which does not use recursion.
GNU General Public License v3.0
0 stars 1 forks source link

Add useful optimisations from Ijtihad #2

Open vedadux opened 6 years ago

vedadux commented 6 years ago

The following features have proven to be useful and should be implemented before the first release:

  1. Formula trimming for A and B
  2. Reuse of Tseitin variables
  3. Depth based clause deduplication (maybe)
vedadux commented 6 years ago
  1. Formula trimming has now been implemented in NanoQBF
vedadux commented 5 years ago
  1. Depth based clause deduplication is now in NanoQBF