Skip to main content
PSU CS
  • You are currently using guest access (Log in)

CS 251 - Discrete Structures II (Spring 2016)

Page path
  • Home / ►
  • Courses / ►
  • Miscellaneous / ►
  • CS 251 S2016 / ►
  • General / ►
  • Prop. Resolution

Prop. Resolution

Lecture notes on propositional resolution theorem proving.
Click http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-825-techniques-in-artificial-intelligence-sma-5504-fall-2002/lecture-notes/Lecture7FinalPart1.pdf link to open resource.
Skip Navigation

Navigation

  • Home

    • Site pages

      • Tags

      • Calendar

      • ForumSite news

    • Current course

      • CS 251 S2016

        • Participants

        • General

          • ForumNews forum

          • PageSyllabus

          • URLZ Reference Manual

          • FileUsing Z Book

          • URLforall x [textbook]

          • FileDeduction Rules

          • URLProp. Resolution

          • URLConversion to Clausal Form

          • URLDPLL Prop. SAT Algorithm

          • FileGSAT, WSAT: Local Search for SAT

          • PageUnification

          • URLHorn Logic

          • URLHoare Logic

          • FileQuiz 1 Notes

          • FileTopological Sort

          • FileQuiz 2 Notes

          • URLADTs

          • FileCounter ADT

          • Filequiz-3 notes

        • 29 March - 4 April

        • 5 April - 11 April

        • 12 April - 18 April

        • 19 April - 25 April

        • 26 April - 2 May

        • 3 May - 9 May

        • 10 May - 16 May

        • 17 May - 23 May

        • 24 May - 30 May

        • 31 May - 6 June

    • Courses

You are currently using guest access (Log in)
CS 251 S2016