This paper studies the relative efficiency of ordered binary decision diagrams (OBDDs) and the Davis-Putnam-Logemann-Loveland procedure (DPLL), two of the main approaches to solving Boolean satisfiability instances. Especially, we show that OBDDs, even when constructed using only the rather weak axiom and join rules, can be exponentially more efficient than DPLL or, equivalently, tree-like reso...

Interpolation means finding intermediate formulae between given formulae. When formulae decorate program locations, and describe sets of program states, interpolation may enable a program analyzer to discover information about intermediate locations and states. This mechanism has an increasing number of applications, that are relevant to program analysis and synthesis. We study interpolation in...

Abstract datatypes can be viewed as sorted ground term algebras. Unification can be used to solve conjunctions of equations. We give a new algorithm to extend this to the full quantifier free fragment, i.e. including formulas with disjunction and negation. The algorithm is based on unification (to deal with equality) and DPLL (to deal with propositional logic). In this paper we present our algo...

We describe and discuss DPLL(T ), a parametric calculus for proving the satisfiability of ground formulas in a logical theory T . The calculus tightly integrates a decision procedure for the satisfiability in T of sets of literals into a sequent calculus based on the well-known method by Davis, Putman, Logemann and Loveland for proving the satisfiability of propositional formulas. For being bas...

Bit Error Rate (BER) performance of the modified structure of a Digital Phase Locked Loop (DPLL) based system for dealing with Nakagami-m fading with coded and un-coded channel is presented here. The emphasis of the work is the implementation of Bose, Chaudhuri and Hocquenghem (BCH) channel coding and decoding technique. The performance of the DPLL for carrier reception with signal under certai...

In this paper, we use gaifman graph to describe the topological structure of the Quantified Boolean Formulae (QBF), we mainly study the formula family with the Small World (SW) network topology. We analyze the traditional Davis, Putnam, Logemann and Loveland (DPLL) solving algorithm for QBF, then we improve the DPLL algorithm and propose the solving algorithm framework based on Small World Opti...

The Davis-Putnam-Logemann-Loveland procedure (DPLL) was introduced in the early 60s as a proof procedure for first-order logic. Nowadays, only its propositional logic core component is widely used in efficient propositional logic provers and respective applications. This success motivates to reconsider lifting DPLL to the first-order logic level in a more contemporary way, by exploiting success...