15-819K Logic Programming
Lecture 20: Bottom-Up Logic Programming

• Reading:
  • Lecture Notes
  • David McAllester.
    On the Complexity Analysis of Static Analyses.
    JACM, 49(4):512-537, 2002.
• Code: none
• Concepts:
  • Bottom-up inference
  • Saturation
  • Transitive closure
  • Complexity analysis
  • Prefix firings
  • CKY parsing
  • Liveness analysis
  • Functional evaluation
• Previous lecture: Verifying Progress
• Next lecture: Forward Chaining

[ Home | Schedule | Assignments | Handouts | Software | Resources ]

fp@cs
Frank Pfenning