Course title
6M0081001
Constraint Programming

 suzuki tetsuya Click to show questionnaire result at 2019
Course content
Constraint programming is a programming method where relations between variables are declaratively described as constraints and they are solved by solvers. The advantages of constraint programming are that there is no need to describe how to solve them and that it makes development and maintenance of software easy. This course will discuss constraint programming with a primary focus on methods of constraint satisfaction.
Purpose of class
The purpose of this class is to understand the concept of constraint programming and its realization methods.
Goals and objectives
  1. Understand a theoretical framework of constraint programming (constraint satisfaction problem, basic framework of constraint solving, equivalence of constraint satisfaction problems, local consistency, search algorithm)
  2. Understand algorithms on which constraint programming is based by implementing them in a programming language
  3. Understand the effects of algorithms on which constraint programming is based
Language
Japanese
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1． Introduction to constraint programming Read the syllabus 190minutes
2． Constraint satisfaction problem Review 190minutes
3． Constraint programming framework Review 190minutes
4． Complete constraint satisfaction method (1) Review 190minutes
5． Complete constraint satisfaction method (2) Review 190minutes
6． Local consistency (1) Review 190minutes
7． Local consistency (2) Review 190minutes
8． Incomplete constraint satisfaction method (1) Review 190minutes
9． Incomplete constraint satisfaction method (2) Review 190minutes
10． Constraint propagation (1) Review 190minutes
11． Constraint propagation (2) Review 190minutes
12． Search Review 190minutes
13． Exercise (1) Review 190minutes
14． Exercise (2) Review 190minutes
Total. - - 2660minutes
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 Report Total.
1. 70% 70%
2. 15% 15%
3. 15% 15%
Total. 100% -
Evaluation method and criteria
Students will be evaluated based on reports.
Textbooks and reference materials
Materials will be provided.
Reference: Krzysztof Apt. Principles of Constraint Programming. Cambridge University Press.
Prerequisites
Basic Java programming skill is required for implementation of algorithms.
Office hours and How to contact professors for questions
  • Lunch break on Wednesday
Relation to the environment
Non-environment-related course
Regionally-oriented
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates an ability for utilizing knowledge
Active-learning course
More than one class is interactive
Course by professor with work experience
Work experience Work experience and relevance to the course content if applicatable
N/A 該当しない
Last modified : Fri Oct 25 04:04:43 JST 2019