CS451: Week Nine

CS 451 Programming Paradigms
Week Nine

Lecture 17 : Tuesday, 3/21/00

Reviewed Church-Turing Hypothesis: what is it, why is it a hypothesis
Introduced declarative programming
"A program states what is true rather than what to do"
Predicate calculus as a representation language
Discussed Horne clause calculus
Negation as failure

Lecture 18 : Thursday, 3/23/00

Presented PROLOG representation: facts, rules, goals
Discussed unification for pattern matching
Relational examples: likes(george,kate) etc.
Looked at left to right depth first search with backtracking in PROLOG
Discussed PROLOG goal reduction

[ Back to CS451: Lecture Summaries ]