Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Davis–Putnam algorithm

Known as: David-Putnam algorithm, Davis-Putnam-method, Davis-Putnam procedure 
The Davis–Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula using a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
This paper presents an optimal power management mechanism for grid connected photovoltaic (PV) systems with storage. The… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We describe a general method for building cascade classifiers from part-based deformable models such as pictorial structures. We… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
  • Wei Lou, Jie Wu
  • 36th Annual Hawaii International Conference on…
  • 2003
  • Corpus ID: 6886222
Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbours. Therefore, the… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
Highly Cited
2003
Highly Cited
2003
RTDP is a recent heuristic-search DP algorithm for solving non-deterministic planning problems with full observability. In… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world… Expand
  • table 2
  • table 1
  • table 3
  • table 4
  • table 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
As was shown recently, many important AI problems require counting the number of models of propositional formulas. The problem of… Expand
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The Davis-Putnam enumeration method (DP) has recently become one of the fastest known methods for solving the clausal satis… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper describes the application of reinforcement learning (RL) to the difficult real world problem of elevator dispatching… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
1994
1994
The Davis-Putnam method is one of the major practical methods for the satiss-ability (SAT) problem of propositional logic. We… Expand
Is this relevant?