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 - Thursday: 11:35 AM - 1 PM (JD 2221)
- Also available by appointment

Resources

Course Materials

Topic	Materials
Introduction	COMP 410 Introduction
Boolean Satisfiability (SAT) and Semantic Tableau	Boolean Satisfiability and Semantic Tableau Worksheet Covering SAT and Semantic Tableau Abstract Syntax Trees (ASTs) and Evaluation Worksheet Covering ASTs and Evaluation Worksheet Covering ASTs and Evaluation (Answers) Example Python Code Implementing an Arithmetic Evaluator of an AST
Introduction to Prolog	Intoductory Prolog Handout Worksheet Covering Introductory Prolog Worksheet Covering Introductory Prolog (Answers)
Unification and Recursion	Unification in Prolog In-Class Worksheet on Unification Repetition and Structures in Prolog In-Class Worksheet on Recursive Procedures Lists in Prolog In-Class Worksheet Involving Unification With Lists In-Class Worksheet on Recursion With(out) Accumulators
Practice Exam #1	Practice Exam for Midterm #1 Solutions for Practice Exam for Midterm #1
Test Case Generation	Test Case Generation in Prolog `naive_generator.pl` `bounded_generator.pl` In-Class Worksheet Involving Test Case Generation
Optimizations	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.
Practice Exam #2	Practice Exam for Midterm #2 Solutions for Practice Exam for Midterm #2
Nondeterminism Without Prolog	Handout on Nondeterminism in Python