English

ALLSAT compressed with wildcards: An invitation for C-programmers

Data Structures and Algorithms 2019-03-15 v2

Abstract

The model set of a general Boolean function in CNF is calculated in a compressed format, using novel wildcards. This method can be explained in very visual ways. Preliminary comparison with existing methods (BDD's and Mathematica's ESOP command) looks promising but our algorithm begs for a C encoding which would render it comparable in more systematic ways.

Keywords

Cite

@article{arxiv.1712.00751,
  title  = {ALLSAT compressed with wildcards: An invitation for C-programmers},
  author = {Marcel Wild},
  journal= {arXiv preprint arXiv:1712.00751},
  year   = {2019}
}

Comments

18 pages

R2 v1 2026-06-22T23:04:54.463Z