COMP 410: Logic Programming

Getting Help

Canvas, for all non-personal communication
Kyle's email address: kyle dot dewey at csun dot edu
Kyle's office hours:
- Monday, Wednesday: 10:00 AM - 11:15 AM (JD 4419)
- Monday, Wednesday: 1:00 PM - 2:15 PM (JD 4419)
- Also available by appointment

Resources

Course Materials

Week	Materials
1	Week 1 Part 1 Lecture Notes Week 1 Part 2 Lecture Notes In-Class Worksheet on Solving SAT with Semantic Tableau
2	Continuing material from prior week
3	In-Class Worksheet on Writing and Evaluating ASTs In-Class Worksheet on Writing and Evaluating ASTs (Answers) `arithmetic_evaluator.py` A Brief Introduction to Prolog In-Class Worksheet Introducing Prolog In-Class Worksheet Introducing Prolog (Answers)
4	Unification in Prolog In-Class Worksheet on Unification Repetition and Structures in Prolog In-Class Worksheet on Recursive Procedures
5	Material from prior week
6	Material from prior week
7	Practice Exam for Midterm #1 Solutions for Practice Exam for Midterm #1
8	Lists in Prolog In-Class Worksheet Involving Unification With Lists In-Class Worksheet on Recursion With(out) Accumulators
9	Test Case Generation in Prolog `naive_generator.pl` `bounded_generator.pl` In-Class Worksheet Involving Test Case Generation
10	Continuation of prior materials
11	Discussion of Optimizations in Prolog `tents_naive.pl`, a naive solver for the Tents Puzzle `tents_optimized.pl`, an optimized version of `tents_naive.pl`, which can solve all test boards within seconds as opposed to likely weeks. Optimized primarily by reordering conjunctions and avoiding fruitless search, as discussed in the aforementioned handout concerning optimizations.
12	Continuing material from prior week
13	Practice Exam for Midterm #2 Solutions for Practice Exam for Midterm #2
14	Handout on Nondeterminism in Python
15	Final Practice Exam Final Practice Exam With Answers