dlewissandy/simple-sat

Issues

• As a data analyst I need to construct logical expressions with universal and existential quantifiers

  #19 opened 8 years ago
  0

• Investigate alternative in memory representations

  #18 opened 8 years ago
  0

• Create a test to verify that operations preserve term ordering

  #15 opened 8 years ago
  1

• Create n queens pretty example program

  #14 opened 8 years ago
  0

• Implement CNF internal representation for benchmarking purposes

  #12 opened 8 years ago
  0

• Add cheap versions of logical operations to avoid combination of namespaces

  #11 opened 8 years ago
  0

• Add more logical connectives

  #10 opened 8 years ago
  2

• Implement parser so that users can read logical expressions from files

  #9 opened 8 years ago
  2

• Implement benchmarks to quantify time performance.

  #8 opened 8 years ago
  1

• Implement Heap based multiplication for binary AND.

  #7 opened 8 years ago
  3

• As a user of the simple SAT solver, I would like an example that demonstrates how to use the library

  #5 opened 8 years ago
  2

• As a user of the simple SAT solver, I would like to be able to determine the basis of a set of equations

  #4 opened 8 years ago
  0

• Given A boolean set of boolean expressions, I would like to be able to determine if the equations are satisfiable.

  #3 opened 8 years ago
  2

• As a user of the simple SAT solver, I would like a method to pretty print expressions to that I can visually inspect them for correctness.

  #2 opened 8 years ago
  1

• As a user of the simple SAT solver I would like to be able to encode expressions for sat solving

  #1 opened 8 years ago
  1