Nenofex
| Submitter: | Florian Lonsing | ||
| Description: | Nenofex is an expansion-based QBF solver which operates on negation normal form (NNF). A formula in NNF is represented as a structurally restricted tree. Expansions are scheduled based on estimated expansion costs. | ||
| Results: | |||