|
國立雲林科技大學授課科目教學計畫表 |
P.1 |
|
科目名稱: 邏輯與正規語言 | ||||||
|
學期課號:5210 |
講授-實習-學分:3-0-3 | |||||
|
學年:95 |
學期:2 |
系所年級:運算所研一 |
教師:黃永廣 | |||
|
教學目標: | ||||||
|
本課程的目標是讓學生瞭解邏輯程式語言Prolog與正規語言的基礎觀念,如何用Prolog制作各種搜尋演算法,並在程式設計中應用這些觀念。 | ||||||
|
| ||||||
|
教學活動: | ||||||
|
課堂講授與討論 | ||||||
|
| ||||||
|
評量方式: | ||||||
|
1.作業 70% | ||||||
|
2.期末專題書面報告 15% | ||||||
|
3.期末專題口頭報告 15% | ||||||
|
教科書及參考書(請依作者,書名,版次,出版人,出版地,出版年月,起訖頁次等順序填寫): | ||||||
|
教科書: Sipser Michael, Introduction to the Theory of Computation, PWS Publishing Company, 1997. 新月代理 | ||||||
|
參考書: Bratko, Prolog Programming for Artificial Intelligence (3rd edition), Addison-Wesley, 2000.Kelly, John. (1997). The Essence of Logic. Prentice Hall. 華通代理. Mitchell, William. 劉育東譯. 建築的設計思考:設計、運算、與認知. | ||||||
|
其他說明:(上課時間、Office Hours、教室…) 參考網頁: http://nlp.kaist.ac.kr/~cs370/ http://www.coli.uni-saarland.de/~kris/learn-prolog-now/
| ||||||
|
上課時間: 星期二 9:10-12:00 教室:DC332 | ||||||
|
Office hours: 星期一、五 9:00-11:00 Office: ES 707 ~4330 | ||||||
|
學程召集人: |
張登文 |
填表教師: |
黃永廣 | |||
|
或系所主管 |
|
95 年 12 月 15 日 | ||||
註:請授課教師依教學大綱填寫本表,並分送課程所屬學程(或系所)及上課班級學生。
|
國立雲林科技大學授課科目教學計畫表 |
P.2 |
科目名稱: 邏輯與正規語言
|
週次 |
上課日期 |
教 學 與 作 業 進 度 |
備 註 |
|
1 |
2/27 |
Introduction, Syntax and meaning of Prolog programs |
|
|
2 |
3/6 | Lists, operators and arithmetic, Depth-first search | |
|
3 |
3/13 | Using structures, Iterative depth-first search | |
|
4 |
3/20 | Controlling backtracking, Heuristic depth-first search | |
|
5 |
3/27 |
Input & Output, Breadth-first search
|
|
|
6 |
4/3 | Declarative programming, Best-first search and A* | |
|
7 |
4/10 | Programming style, Iterative deepening search (IDA*) | |
|
8 |
4/17 | Operations on data structure, Recursive Best-First Search | |
|
9 |
4/24 | Problem solving strategies | |
|
10 |
5/1 | Languages, deterministic finite automata | |
|
11 |
5/8 | Deterministic finite automata | |
|
12 |
5/15 |
Nondeterministic finite automata |
|
|
13 |
5/22 | Regular languages, regular expression, regular grammar | |
|
14 |
5/29 | Non-regular languages, pumping lemma | |
|
15 |
6/5 |
Context-free grammar and context-free languages
|
|
|
16 |
6/12 | Non-context free languages, pumping lemma | |
|
17 |
6/19 | Pushdown automata, Turing machine | |
| 18 | 6/26 | Exam week | |
|
|
|||
|
|