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 (all via Zoom; see Canvas or email me for details):
- Tuesday: 5:00 PM - 6:00 PM
- Wednesday: 5:00 PM - 7:00 PM
- Thursday: 5:00 PM - 6:00 PM
- Also available by appointment

Resources

Weekly Course Materials

Week	Materials
1	Week 1 Part 1 Lecture Notes Week 1 Part 2 Lecture Notes `arithmetic_evaluator.py` In-Class Worksheet on Writing and Evaluating ASTs In-Class Worksheet on Writing and Evaluating ASTs (Answers) In-Class Worksheet on Solving SAT with Semantic Tableau
2	Material from prior week
3	A Brief Introduction to Prolog In-Class Worksheet Introducing Prolog In-Class Worksheet Introducing Prolog (Answers)
4	Repetition and Structures in Prolog In-Class Worksheet on Recursive Procedures
5	Practice Exam for Midterm #1 (PDF Version) Practice Exam for Midterm #1 (DOCX Version) Solutions for Practice Exam for Midterm #1 (PDF Version) Solutions for Practice Exam for Midterm #1 (DOCX Version)
6	Material from prior week
7	Unification in Prolog In-Class Worksheet on Unification
8	Lists in Prolog In-Class Worksheet Involving Unification With Lists In-Class Worksheet on Recursion With(out) Accumulators Test Case Generation in Prolog `naive_generator.pl` `bounded_generator.pl` In-Class Worksheet Involving Test Case Generation
9	Material from week 8
10	Material from week 8
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	Practice Exam for Midterm #2 Solutions for Practice Exam for Midterm #2
13	Material from prior week
14	Material from prior week
15	For the final, all the prior handouts, assignments, and practice exams are fair game. There will not be any questions related to implementing logic programming in a non-logical language.