The following pages link to PSATO (Q15174):
Displaying 40 items.
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
- A collaborative approach for multi-threaded SAT solving (Q839500) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Applying SAT solving in classification of finite algebras (Q862393) (← links)
- Parallelization of a hyper-linking-based theorem prover (Q1595925) (← links)
- A taxonomy of parallel strategies for deduction (Q1601867) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- Frame self-orthogonal Mendelsohn triple systems (Q1780305) (← links)
- An overview of backtrack search satisfiability algorithms (Q1861908) (← links)
- Leveraging GPUs for effective clause sharing in parallel SAT solving (Q2118339) (← links)
- Solving SAT in a distributed cloud: a portfolio approach (Q2299084) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Community and LBD-based clause sharing policy for parallel SAT solving (Q2661331) (← links)
- Reproducible efficient parallel SAT solving (Q2661341) (← links)
- Parallelizing SATZ using dynamic workload balancing (Q2741522) (← links)
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications (Q2741526) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- (Q3011296) (← links)
- Partitioning Search Spaces of a Randomized Search (Q3100181) (← links)
- Search-Space Partitioning for Parallelizing SMT Solvers (Q3453241) (← links)
- (Q3604001) (← links)
- (Q3639754) (← links)
- (Q3639755) (← links)
- (Q4475625) (← links)
- Merging Logic Programs under Answer Set Semantics (Q4649730) (← links)
- (Q4708203) (← links)
- (Q4792328) (← links)
- Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction (Q4913865) (← links)
- Partitioning SAT Instances for Distributed Solving (Q4933318) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- Challenges in Constraint-Based Analysis of Hybrid Systems (Q5191406) (← links)
- SATO: An efficient propositional prover (Q5234711) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473971) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473975) (← links)
- Strategies for Solving SAT in Grids by Randomized Search (Q5505494) (← links)
- (Q5687274) (← links)
- Theory and Applications of Satisfiability Testing (Q5713743) (← links)
- Correct Hardware Design and Verification Methods (Q5897077) (← links)
