Undergraduate Course: Logic Programming (INFR09031)

Course Outline
School	School of Informatics	College	College of Science and Engineering
Course type	Standard	Availability	Available to all students
Credit level (Normal year taken)	SCQF Level 9 (Year 3 Undergraduate)	Credits	10
Home subject area	Informatics	Other subject area	None
Course website	http://www.inf.ed.ac.uk/teaching/courses/lp	Taught in Gaelic?	No
Course description	This course describes the connection between Horn clause logic and computation via programming. The reference point for the course is the Prolog programming language ż a principal aim being to develop studentsż programming expertise through experience in typical applications. The course is divided into two interacting sections: a theory section and a programming section.

Entry Requirements (not applicable to Visiting Students)
Pre-requisites		Co-requisites
Prohibited Combinations		Other requirements	This course is open to all Informatics students including those on joint degrees. For external students where this course is not listed in your DPT, please seek special permission from the course organiser. This course has the following mathematics prerequisites: - Propositional logic (at the level taught in Informatics 1 Computation and Logic). - First Order Logic (at the level taught in Informatics 2D).
Additional Costs	None

Information for Visiting Students
Pre-requisites	None
Displayed in Visiting Students Prospectus?	Yes

Course Delivery Information

Delivery period: 2014/15 Semester 1, Available to all students (SV1)			Learn enabled: No	Quota: None
Web Timetable	Web Timetable
Course Start Date	15/09/2014
Breakdown of Learning and Teaching activities (Further Info)	Total Hours: 100 ( Lecture Hours 20, Seminar/Tutorial Hours 8, Summative Assessment Hours 3, Programme Level Learning and Teaching Hours 2, Directed Learning and Independent Learning Hours 67 )
Additional Notes
Breakdown of Assessment Methods (Further Info)	Written Exam 40 %, Coursework 20 %, Practical Exam 40 %
Exam Information
Exam Diet	Paper Name	Hours & Minutes
Main Exam Diet S2 (April/May)	Theory	1:00
Main Exam Diet S2 (April/May)	Programming	2:00
Resit Exam Diet (August)	Theory	1:00
Resit Exam Diet (August)	Programming	2:00

Delivery period: 2014/15 Semester 1, Part-year visiting students only (VV1)			Learn enabled: No	Quota: None
Web Timetable	Web Timetable
Course Start Date	15/09/2014
Breakdown of Learning and Teaching activities (Further Info)	Total Hours: 100 ( Lecture Hours 20, Seminar/Tutorial Hours 8, Summative Assessment Hours 2, Programme Level Learning and Teaching Hours 2, Directed Learning and Independent Learning Hours 68 )
Additional Notes
Breakdown of Assessment Methods (Further Info)	Written Exam 40 %, Coursework 20 %, Practical Exam 40 %
Exam Information
Exam Diet	Paper Name	Hours & Minutes
Main Exam Diet S1 (December)	Theory	1:00
Main Exam Diet S1 (December)	Programming	2:00

Summary of Intended Learning Outcomes
Students should learn how to: 1) Understand and explain principles of declarative specification, and its relation to procedural realisations 2) Construct well-crafted Prolog programs of moderate size and sophistication 3) interpret problems in a style that suits logic programming 4) understand and explain the logical foundations of logic programming

Assessment Information
Written Examination 80 Assessed Assignments 20 Oral Presentations 0 Assessment Two pieces of assessed coursework each contribute 10% to the final course grade, and are particularly directed at learning outcomes 1 and 2. There are two examinations, one a written theory exam and one a programming practical, each contributing 40% to the final course grade If delivered in semester 1, this course will have an option for semester 1 only visiting undergraduate students, providing assessment prior to the end of the calendar year.

Special Arrangements
None

Additional Information
Academic description	Not entered
Syllabus	The following are core elements of the syllabus: - Programming: Declarative programming: goals, programs, recursion; Nonlogical features; parsing and DCGs; search techniques; reflection and meta-programming; higher-order logic programs - Theory: Definite clause logic (propositional and predicate); Inference systems, proof search, completeness and incompleteness; Herbrand models; Negation by failure and completion procedures; Higher-order Logic Programming. Relevant QAA Computing Curriculum Sections: Artificial Intelligence, Programming Fundamentals
Transferable skills	Not entered
Reading list	* Clocksin, W.F. and Mellish, C.S., 2003, "Programming in Prolog: Using the ISO Standard" * Sterling, L. & Shapiro, E. 1994, "The Art of Prolog"
Study Abroad	Not entered
Study Pattern	Lectures 20 Tutorials 8 Timetabled Laboratories 0 Non-timetabled assessed assignments 12 Private Study/Other 60 Total 100
Keywords	Not entered