PSATO: A distributed propositional prover and its application to quasigroup problems
From MaRDI portal
Recommendations
Cited in
(26)- A fast parallel SAT-solver -- efficient workload balancing
- PSATO
- Parallelizing SMT solving: lazy decomposition and conciliation
- Frame self-orthogonal Mendelsohn triple systems
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Solving SAT in a distributed cloud: a portfolio approach
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies
- Parallelizing SATZ using dynamic workload balancing
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- HordeQBF: a modular and massively parallel QBF solver
- Search-space partitioning for parallelizing SMT solvers
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- An overview of parallel SAT solving
- Multi-threaded ASP solving with clasp
- Loops with abelian inner mapping groups: an application of automated deduction
- On black-box optimization in divide-and-conquer SAT solving
- Finding Effective SAT Partitionings Via Black-Box Optimization
- Challenges in Constraint-Based Analysis of Hybrid Systems
- SATO: An efficient propositional prover
- Towards better heuristics for solving bounded model checking problems
- Distributed bounded model checking
- Quantum circuit mapping based on incremental and parallel SAT solving
- A parallelization scheme based on work stealing for a class of SAT solvers
- A collaborative approach for multi-threaded SAT solving
- A competitive and cooperative approach to propositional satisfiability
- Applying SAT solving in classification of finite algebras
This page was built for publication: PSATO: A distributed propositional prover and its application to quasigroup problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365127)
