GitHub

Automated Reasoning project: CDCL Algorithm

First assertion clause heuristic for learning and backjumping (aka. first unique implication point, 1UIP); Two watched literals technique for propagation; A Variable State Independent Decaying ...
GitHub

SAT Solver Implementation with DPLL, CDCL, and VSIDS Heuristics

This project implements a SAT solver using the DPLL algorithm with Conflict-Driven Clause Learning (CDCL) and Variable State Independent Decaying Sum (VSIDS) heuristics in C++. It is designed to read ...
IEEE

HyQSAT: A Hybrid Approach for 3-SAT Problems by Integrating Quantum Annealer with CDCL

Abstract: Propositional satisfiability problem (SAT) is represented in a conjunctive normal form with multiple clauses, which is an important non-deterministic polynomial-time (NP) complete problem ...
www.cs.utexas.edu

NeuroComb: Improving SAT Solving with Graph Neural Networks (2024)

Propositional satisfiability (SAT) is an NP-complete problem that impacts many research fields, such as planning, verification, and security. Mainstream modern SAT solvers are based on the ...