A new set of algebraic benchmark problems for SAT solvers

Authors:
Andreas Meier;Volker Sorge
Affiliations:
DFKI GmbH, Saarbrücken, Germany;School of Computer Science, University of Birmingham, UK
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 6
Cited 1

PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
Specifying Latin square problems in propositional logic

Automated reasoning and its applications
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
S PASS Version 2.0

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Applying SAT Solving in Classification of Finite Algebras

Journal of Automated Reasoning
Automatic generation of some results in finite algebra

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1

Satisfiability checking of non-clausal formulas using general matings

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new benchmark set consisting of problems generated during the construction of classification theorems for quasigroups. It extends and generalises the domain of quasigroup existence problems, to which SAT solvers have been applied successfully in the past, to a rich class of benchmarks of varying difficulty.