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

Author:  Himanshu Jain

9971 downloads 10194 Views 468KB Size

Recommend Documents

We address lower bounds on the time complexity of algorithms solving the propositional satisfiability problem. Namely, we consider two DPLL-type algorithms, enhanced with the unit clause and pure literal heuristics. Exponential lower bounds for solvi

We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally rea

For any standard communication setup, an efficient demodulation techniques which not only filters out the high frequency carrier component but also retrieves the transmitted message pulse in a proper fashion with all its properties like amplitude, fr

We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that despite their

Modern SAT solvers have experienced a remarkable progresson solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that thesetechniques exploit the underlying structure of indu