relsat is a program for solving instances of the propositional satisfiability problem (SAT). For a given input instance, it can be used to determine satisfiability, output any number of solutions (should they exist), or determine the exact number of solutions

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Miyata, Hiroyuki; Padrol, Arnau: Enumerating neighborly polytopes and oriented matroids (2015)