IEEE

Tutorial proposal efficient solving of optimization problems using advanced boolean satisfiability and Integer Linear Programming techniques

Abstract: Recent years have seen a tremendous growth in the number of research and development groups at universities, research labs, and companies that have started using Boolean Satisfiability (SAT) ...
GitHub

Quantum SAT Solver - QCIC 766 Project

The Boolean Satisfiability Problem (SAT) is one of the most fundamental problems in computer science and the first problem proven to be NP-complete. This project implements a quantum approach to ...
Scientific Research Publishing

Quantum Algorithm for Solving Tautology and Satisfiability Problems ()

This paper proposes a quantum algorithm for solving the tautology and the satisfiability problems for a Boolean formula. Let’s say we are given a Boolean formula. The variables of the Boolean formula ...
www.cs.cmu.edu

Midterm 2

Describe the definition of (Boolean) Satisfiability Problem (SAT). Describe conjunctive normal form (CNF). Understand the algorithm DPLL for solving SAT problems. Describe and create a Successor-State ...
IEEE

Chameleon-SAT: An Adaptive Boolean Satisfiability Accelerator Using Mixed-Signal In-Memory Computing for Versatile SAT Problems

Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...