User Tools

Site Tools

Trace: • lecture_5
plt17:lecture_5

Lecture 5

Lecture 5 Slides (Boolean Satisfiability (SAT) Solving)

Readings

  • Martin Davis, George Logemann, Donald Loveland: “A machine program for theorem-proving”, Communications of the ACM (CACM), July 1962
plt17/lecture_5.txt · Last modified: 2017/09/08 15:36 by hossein

Page Tools