A New Approach to CNF-SAT From a Probabilistic Point of View

by   Hazem J. Alkhatib, et al.

The following paper proposes a new approach to determine whether a logical (CNF) formula is satisfiable or not using probability theory methods. Furthermore, we will introduce an algorithm that speeds up the standard solution for (CNF-SAT) in some cases. It is known that any (CNF) formula is solved with a time complexity of 2^n where n is the number of different literals in the (CNF) formula. In our approach, we will follow an enhanced method from a probabilistic point of view that does not always increase exponentially with the number of different literals. This will enhance the chance of determining whether a large formula is satisfiable or not in many cases. Additionally, we will point out at some promising properties that follow from applying probability theory concepts and axioms to logic, which might originate more insights about the satisfiability of logical formulas.


page 1

page 2

page 3

page 4


A Polynomial Decision for 3-SAT

We propose a polynomially bounded, in time and space, method to decide w...

New worst upper bound for #SAT

The rigorous theoretical analyses of algorithms for #SAT have been propo...

A Data-Centric View on Computational Complexity: P = NP

P = NP SAT ∈ P. We propose this to be true because the satisfiability ...

Formula-Based Probabilistic Inference

Computing the probability of a formula given the probabilities or weight...

Tighter Connections Between Formula-SAT and Shaving Logs

A noticeable fraction of Algorithms papers in the last few decades impro...

On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm

Lifted inference allows to perform inference in polynomial time w.r.t. d...

Demo: New View on Plasma Fractals – From the High Point of Array Languages

Plasma fractals is a technique to generate random and realistic clouds, ...

Please sign up or login with your details

Forgot password? Click here to reset