• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS CSE 6005 CONSTRAINT 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

ASSOCIATE PROFESSOR GÖKHAN DALKILIÇ

Offered to

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

Course Objective

The aim of this course is to provide the students to learn the constraint programming concepts and use those concepts.

Learning Outcomes of the Course Unit

1   Solve planning and scheduling problems 2   Define logical relation between unknowns 3   Apply constraint programming on practical problems 4   Use appropriate algorithms 5   Define over constraint systems

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction 2 Algorithm 3 Foundations from Logic 4 Preliminaries of Syntax and Semantics 5 Logic Programming 6 Constraint Logic Programming 7 Concurrent Constraint Logic Programming 8 Constraint Handling Rules 9 Constraint Systems and Constraint Solvers 10 Boolean Algebra B 11 Rational Trees RT 12 Linear Polynomial Equations 13 Finite Domains FD 14 Non-linear Equations

Recomended or Required Reading

Textbook(s): Frühwirth, Thom, Abdennadher, Slim, Essentials of Constraint Programming, ISBN 978-3-540-67623-2, Springer References: Journal Papers

Planned Learning Activities and Teaching Methods

: By using presentation tools the course is taught in class. By giving programming assignments and project, all the students are expected to learn the constraint programming techniques.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 RPT REPORT 2 PRS PRESENTATION 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE RPT * 0.25 + PRS * 0.25 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE RPT * 0.25 + PRS * 0.25 + FIN * 0.50 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Dokuz Eylul University Department of Computer Engineering Tinaztepe Campus 35160 BUCA/IZMIR Tel: +90 (232) 301 74 01

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 3 42 Preparation before/after weekly lectures (reading course materials, etc.) 14 4 56 Preparation for final exam 1 10 10 Preparing assignments 4 9 36 Preparing presentations 2 5 10 Other (research, paper reading, etc.) 3 15 45 Final 1 2 2 TOTAL WORKLOAD (hours) 201

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 LO.1 4 5 5 5 4 5 4 4 LO.2 3 4 4 5 5 LO.3 5 5 5 4 5 5 5 5 5 LO.4 5 5 5 5 5 5 4 4 5 LO.5 4 4 5 4 5 5