COURSE UNIT TITLE

: ADVANCED CONSTRAINT LOGIC PROGRAMMING

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CSE 6006 ADVANCED CONSTRAINT LOGIC PROGRAMMING ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

PROFESSOR DOCTOR DERYA BIRANT

Offered to

Computer Engineering (English)
Computer Engineering (English)
COMPUTER ENGINEERING (ENGLISH)

Course Objective

Foundations of logic and constraint programming are studied from the declarative and operational point of view for the logical component, and from the operational point of view for the constraint extension.
Some of the most common constraint domains, their solvers and applications such as Boolean constraints for circuit design, linear polynomial equations for financial and engineering applications and finite domains for scheduling will be presented.

Learning Outcomes of the Course Unit

1   Understand the principles of logic programming and its extention to constraint logic programming
2   Understand the principles of Constraint handling rules
3   Represent knowledge in the form of Prolog facts and rules
4   Write simple Prolog programs that can compute relations using facts and rules
5   Demonstrate an understanding of the principles underlying Prolog and constraint logic programming

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to logic programming
2 Problem specification versus algorithm
3 Relations versus functions
4 Logical bases, terms, atoms, first order logics
5 Horn Clauses
6 Declarative semantics of a pure Prolog program
7 Pure Prolog problem operational semantics
8 Constraint languages
9 Linear rational constraints
10 Finite Domains
11 Boolean Constraints, Finite or Infinite Trees
12 Constraint Logic Programming, Paradigm
13 Constraint Search Trees
14 Student Presentations

Recomended or Required Reading

Textbook(s): Ivan Bratko, Prolog Programming for Artificial Intelligence, 3rd edition, Addison-Wesley, 2001.
Supplementary Book(s): Leon Stirling & Ehud Shapiro, The Art of Programming, 2nd edition, The MIT Press, 1994

Planned Learning Activities and Teaching Methods

Presentation, paper research, term project and examination.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 ASG ASSIGNMENT
3 RPT REPORT
4 FIN FINAL EXAM
5 FCG FINAL COURSE GRADE MTE * 0.30 +ASG +RPT/2 * 0.30 +FIN * 0.40
6 RST RESIT
7 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 +ASG +RPT/2 * 0.30 +RST * 0.40


Further Notes About Assessment Methods

None

Assessment Criteria

Learning Outcomes (LO) 1, 2, 3, 4, and 5 will be assessed by examination. LOs 2, 3, 4, and 5 will also be assessed by Assignments, and Term Project.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Prof.Dr. Derya BIRANT
Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: +90 (232) 301 74 01
E-mail: derya@cs.deu.edu.tr

Office Hours

Friday 13:00 15:00

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparation for midterm exam 1 4 4
Preparation for final exam 1 6 6
Preparing assignments 3 6 18
Preparing presentations 2 5 10
Design Project 4 20 80
Preparations before/after weekly lectures 14 2 28
Midterm 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 192

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11
LO.133233323222
LO.233233323222
LO.333233323222
LO.433233323222
LO.533233323222

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS