Back to AIBriefs
AnalysisAI Models

Paper studies parallel CLS for pseudo-Boolean satisfiability

Arxiv CS.AI (top papers)

The paper proposes parallel Continuous Local Search (CLS) for solving symmetric pseudo-Boolean (PB) satisfiability problems. It relaxes the n-variable PB-SAT problem to continuous optimization and explores parallelization.

·
3 days ago
Paper studies parallel CLS for pseudo-Boolean satisfiability — AIBriefs