Many popular SAT algorithms are incomplete. We are especially interested in SAT-encoded problemsįrom other domains, for example, encodings of problems available fromĪt the moment, we provide mainly satisfiable instances, as Please help us to extend our benchmark set by submitting new benchmark instances or suggesting existing benchmarks we A SAT solver that implements the Davis-Putnam-Logemann-Loveland (DPLL) algorithm. For a description of theĭIMACS Challenge - Satisfiability: Suggested Format (ps file, 108k) This format is supported by most of the solvers provided Being in Java, the promise is not to be the fastest one to solve those problems (a SAT solver in Java is about 3.25 times slower than its counterpart in. All instances provided here are cnf formulae encoded The Maximum Satisfiability (MaxSAT) problem is an optimization version of the Propositional Satisfiability (SAT) problem which consists in.
0 Comments
Leave a Reply. |