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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1965-2018
010203019652018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in… (More)
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… (More)
  • table 2
  • table 3
  • table 4
  • table 1
  • table 5
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… (More)
  • figure 1
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The high computational complexity of advanced reasoning tasks such as belief revision and planning calls for efficient and… (More)
  • figure 3
Is this relevant?
1996
1996
It is by now well known that randomly generated 3-SAT problems are very difficult to solve on the average when the ratio of… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • table I
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… (More)
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… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The paper presents algorithm directional resolution, a variation on the original DavisPutnam algorithm, and analyzes its… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the Davis… (More)
Is this relevant?
1989
1989
A resolution proof of an unsatisfiable propositional formula in conjunctive normal form is a “Davis-Putnam resolution proof” iff… (More)
Is this relevant?