CS 555 - DECLARATIVE PROGRAMMING

College of Engineering

Credit(s): 3

The course covers fundamentals of propositional and predicate logic, and their uses in declarative programming to model and solve computational problems. Topics include propositional satisfiability, satisfiability testing techniques such as the DPLL algorithm, automated reasoning techniques for predicate logic such as resolution with unification and logic programming.

Prereq: CS 315 and CS 375 or consent of instructor.