Logic programming 1000-2N00PLO
1. Logic programming paradigm (declarative versus imperative programming).
2. SLD-resolution (unification, resolution rule).
3. Semantics of logic programs (soundness and completeness of SLD-resolution).
4. Negation in logic programming: negation as (finite) failure rule, normal programs.
5. Control in logic programming (cut).
6. Alternative logic programming schemes (Constraint Logic Programming, concurrency, declarative debugging).
Type of course
Mode
Prerequisites (description)
Course coordinators
Assessment criteria
Final grade is based on the sum of points from the colloquium (20 points),
two programming laboratory tasks during the classes (2*10 points) and the exam (60 points).
In retake session final grade is based only on the points from the exam.
Bibliography
1. U.Nilsson, J.Małuszyński ,"Logic Programming and Prolog", wyd. 2, John Wiley, 1995,. http://www.ida.liu.se/~ulfni/lpp/
2. K.R.Apt ,"From Logic Programming to Prolog". 1997.
3. L.Sterling, E.Shapiro, The Art of Prolog. MIT, 1994.
4. W.F.Clocksin, C.S.Mellish, Programming in Prolog. Springer, 1994.
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
- Bachelor's degree, first cycle programme, Computer Science
- Master's degree, second cycle programme, Computer Science
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: