Download presentation
Presentation is loading. Please wait.
1
For Monday Take home exam due Exam 1
2
For Wednesday Read chapter 10, sections 1-2 Prolog Handout 4
3
Program 2
4
Negation Can’t say something is NOT true Use a closed world assumption Not simply means “I can’t prove that it is true”
5
Dynamic Predicates A way to write self-modifying code, in essence. Typically just storing data using Prolog’s built-in predicate database. Dynamic predicates must be declared as such.
6
Using Dynamic Predicates assert and variants retract –Fails if there is no clause to retract retractall –Doesn’t fail if no clauses
7
Exam Review?
Similar presentations
![1 Prolog III. 2 Lists [ ] is the empty list. [x, 2+2, [a, b, c]] is a list of three elements. The first element in the list is its “head”. The list with.](/14/4394832/big_thumb.jpg "1 Prolog III. 2 Lists [ ] is the empty list. [x, 2+2, [a, b, c]] is a list of three elements. The first element in the list is its “head”. The list with.>")
