ScholarLens Back to search
2010•Unpublished venueRequires access

SAT and DPLL

Espen H. Lian

Open publisher page 0 citations

Abstract

I SAT is the problem of determining if a propositional formula (on conjunctive normal form) is satisfiable. I The DPLL (Davis-Putnam-Logemann-Loveland) procedure from 1962 [2] is an algorithm solving SAT. I DPLL is a refinement of the DP (Davis-Putnam) procedure from 1960 [3]. I We present (a version of) DPLL as a calculus. I DPLL is interesting because it works well in practice, ie. the best SAT solvers are based on DPLL.

About this research paper

What this paper is about

I SAT is the problem of determining if a propositional formula (on conjunctive normal form) is satisfiable. I The DPLL (Davis-Putnam-Logemann-Loveland) procedure from 1962 [2] is an algorithm solving SAT. I DPLL is a refinement of the DP (Davis-Putnam) procedure from 1960 [3]. I We present (a version of) DPLL as a calculus. I DPLL is interesting because it works well in practice, ie. the best SAT solvers are based on DPLL.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

I SAT is the problem of determining if a propositional formula (on conjunctive normal form) is satisfiable. I The DPLL (Davis-Putnam-Logemann-Loveland) procedure from 1962 [2] is an algorithm solving SAT. I DPLL is a refinement of the DP (Davis-Putnam) procedure from 1960 [3]. I We present (a version of) DPLL as a calculus. I DPLL is interesting because it works well in practice, ie. the best SAT solvers are based on DPLL.

Key concepts: DPLL algorithm, Conjunctive normal form, Mathematics, Algorithm, Calculus (dental), Computer science, Phase-locked loop, Jitter

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
SAT and DPLL — Research Paper | ScholarLens