GitHub

dpll-algorithm

An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
IEEE

Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts

Abstract: Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solvers are based ...
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 ...
www.cs.cmu.edu

Propositional Logic and SAT

Define the following logic terms and apply them to real-world problems: Describe the simple model checking algorithm and the theorem proving algorithms - forward chaining and resolution, what they ...
www.cs.cmu.edu

Propositional Logic and SAT

Define the following logic terms and apply them to real-world problems: Describe the simple model checking algorithm and the theorem proving algorithms - forward chaining and resolution, what they ...