GitHub

Python SAT Solver (DPLL + CDCL + VSIDS) – A from-scratch implementation of modern SAT solving algorithms with clause learning, non-chronological backtracking, heuristics, and ...

This project is my independent research into SAT solvers written entirely in Python, designed to explore the theory and practice of propositional satisfiability. It begins with a baseline DPLL ...
IEEE

A new FPGA-based DPLL algorithm to improve SAT solvers

Abstract: SAT (SATisfiability of Propositional Formula) is a well-known NP-Complete problem [1][2]. Conventional solvers for SAT based on traditional DPLL algorithm presents serious CPU-Times ...
GitHub

dpll-solver

This program calculates the DPLL Algorithm for you. It is basically a SAT Solver for CNF's. There are three main reasons why I made this program. firstly I wanted to better learn python, secondly I ...
IEEE

A Robust Timing Recovery Algorithm with Enhanced DPLL Performance for Nyquist Digital Multi-band Optical Systems

Abstract: We propose a novel timing recovery algorithm (TRA) for Nyquist digital multi-band optical coherent systems. The proposed TRA employs two complementary metrics to cover all states of ...
The New York Times

Algorithms Are Making Kids Desperately Unhappy

Mr. Murphy is the junior senator from Connecticut. Kids are even more in the bag of social media companies than we think. So many of them have ceded their online autonomy so fully to their phones that ...
www.cs.utexas.edu

Answer Set Programming

Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic ...
www.cs.cmu.edu

Unit Propagation: The Inner Loop

When the DPLL algorithm 2.2 is implemented and run on practical problems, the bulk of the running time is spent in unit propagation. As an example, Figure 1 gives the amount of time spent by ZCHAFF on ...