Real-world applications, such as diagnosis and embedded control, are increasingly being framed as OpSAT problems problems of finding the best solution that satisfies a formula in propositional state logic. Previous methods, such as Conflict-directed A*, solve OpSAT problems through a weak coupling of A* search, used to generate optimal candidates, and a DPLL-based SAT solver, used to test feasi...

The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, it has been used almost exclusively for propositional logic so far because of its highly inefficient treatment of quantifiers, based on instantiation into ground formulas. The recent FDPLL calculus by Baumgartner was ...

Automated theorem proving is a method to establish or disprove logical theorems. While these can be theorems in the classical mathematical sense, we are more concerned with logical encodings of properties of algorithms, hardware and software. Especially in the area of hardware verification, propositional logic is used widely in industry. Satisfiability Module Theories (SMT) is a set of logics w...

Recently, the classical backtracking-search satis ability algorithm of Davis, Putnam, Loveland and Logemann (DPLL) has been enhanced in two distinct directions: with more advanced reasoning methods, or with con ict-directed back-jumping (CBJ). Previous methods used one idea or the other, but not both (except that CBJ has been combined with the unit-clause rule). The diÆculty is that more advanc...

Most successful systematic SAT-solvers are descendants of the DPLL procedure and so operate on partial assignments. Using partial assignments is explained by the “enumerative semantics” of the DPLL procedure. Current clause learning SAT-solvers, in a sense, have outgrown this semantics. Instead of enumerating the search space as the DPLL procedure does, they explicitly build a resolution proof....

Volume 2, Issue 2 March – April 2013 Page 306 Abstract—Now-a-days various Digital Signal Processing systems are implemented on a platform of programmable signal processors or on application specific VLSI chips. Coordinate Rotation Digital Computer (CORDIC) algorithm has turned out to be such kind of programmable signal processor. In recent times, it has been a widely researched topic in the fie...

This paper presents a generalized nonlinear (Markov) analysis technique that is used to evaluate the statistical performance of uniforn~ly sampled digital phase-locked loop (DPLL) demodulators. Although the rigorous analysis of the statistical performance of the analog PLL for digitally modulated signals (i.e., Costas loops) remains an open problem, the discrete time analysis for MPSK modulatio...

The DPLL algorithm, developed by Davis and Putnam [DP60] and by Davis, Logemann, and Loveland [DLL62], is the most popular complete algorithm for the problem of satisfiability of a set of propositional clauses (SAT). While it is outperformed by local search algorithms on satisfiable formulas [SLM92, SKC94], it is still used because local search algorithms can give a definite answer only if the ...

論理式の充足可能性判定問題(SAT 問題)は NP 困難であり,計算に大変時間が掛かる厄介な問題であ ることが知られている.それにもかかわらず,この問 題を解くための SATソルバ [15], [16]と呼ばれるツー ルの開発が近年競って進められており,実用的な時間 でもかなりの問題が解けるようになってきた.種々の 解きたい組合せ問題をいったん SAT問題に変換した 後に SATツールを利用することで,前者の問題を解 くという応用があり,前者の問題を直接解くプログラ ムを作成するよりも高速に解けることも多いことか ら,この方法は有望視されている.しかしながら,非 常に時間のかかり事実上解けない SAT問題も多いた め [15],ますます SAT ソルバの高速化が求められる ようになってきている. 近年実用化されてきている高速な SATソルバのほ とんどは,論理式を和積形論理式(CNF...