Logic Programming (MAE544): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
(Νέα σελίδα με '=== General === {| class="wikitable" |- ! School | School of Science |- ! Academic Unit | Department of Mathematics |- ! Level of Studies | Undergraduate |- ! Course Code | MAE544 |- ! Semester | 5 |- ! Course Title | Logic Programming |- ! Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 6) |- ! Course Type | Special Background |- ! Prerequisite Courses | - |- ! Language of Instruction and Examinations | Greek |- ! Is the Course Offe...') |
|||
Γραμμή 112: | Γραμμή 112: | ||
! Student Performance Evaluation | ! Student Performance Evaluation | ||
| | | | ||
Final test | |||
|} | |} | ||
=== Attached Bibliography === | === Attached Bibliography === | ||
* Π. Σταματόπουλος, "Λογικός και Συναρτησιακός Προγραμματισμός", Σύνδεσμος Ελληνικών Ακαδημαϊκών Βιβλιοθηκών, 20# http://hdl.handle.net/11419/3587 (με διορθωμένα παροράματα εδώ) | * Π. Σταματόπουλος, "Λογικός και Συναρτησιακός Προγραμματισμός", Σύνδεσμος Ελληνικών Ακαδημαϊκών Βιβλιοθηκών, 20# http://hdl.handle.net/11419/3587 (με διορθωμένα παροράματα εδώ) |
Αναθεώρηση της 14:28, 28 Ιουνίου 2022
General
School |
School of Science |
---|---|
Academic Unit |
Department of Mathematics |
Level of Studies |
Undergraduate |
Course Code |
MAE544 |
Semester |
5 |
Course Title |
Logic Programming |
Independent Teaching Activities |
Lectures (Weekly Teaching Hours: 3, Credits: 6) |
Course Type |
Special Background |
Prerequisite Courses | - |
Language of Instruction and Examinations |
Greek |
Is the Course Offered to Erasmus Students |
Yes (in English) |
Course Website (URL) | - |
Learning Outcomes
Learning outcomes |
The goal of this course is the deeper understanding of PROLOG. During the course a detailed examination of the following topics are done:
After completing the course the student can handle:
|
---|---|
General Competences |
|
Syllabus
- Introductory concepts of Automata , Computability and Complexity as well as basic definitions, basic theorems and inductive proofs
- Finite State Machines and Languages, Finite Automata (Deterministic FA, Nondeterministic FA, FA with Epsilon-Transitions) and their applications, Regular Expressions and Languages, derivation trees. Removing Nondeterminism . Equivalence NFA and NFA with ε-moves. Minimization of DFA, Pumping Lemma
- FA and Grammars. Grammars of Chomsky Hierarchy. Regular Sets (RS). Properties of Regular Languages. RS and FA. Finding a correspondence Regular Expression of a FA. Abilities and disabilities of FA.
- Context-Free Grammars and Languages, Pushdown Automata (Deterministic PDA, Acceptance by Final State, Acceptance by Empty Stack) , Properties of Context-Free Languages. Correspondence PDA and Context-Free Languages.
- Introduction of Turing Machines. Standard TM, useful techniques for TM constructions. Modification of TM. TM as procedure.
- Unsolvability. The Church-Turing Thesis. The Universal TM. The Halting Problem for TM. Computational Complexity. NP-complete problems.
Teaching and Learning Methods - Evaluation
Delivery |
Face to face | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Use of Information and Communications Technology | Yes, Use of Natural Language and Mathematical Problems Processing Laboratory | ||||||||||
Teaching Methods |
| ||||||||||
Student Performance Evaluation |
Final test |
Attached Bibliography
- Π. Σταματόπουλος, "Λογικός και Συναρτησιακός Προγραμματισμός", Σύνδεσμος Ελληνικών Ακαδημαϊκών Βιβλιοθηκών, 20# http://hdl.handle.net/11419/3587 (με διορθωμένα παροράματα εδώ)
- Η. Σακελλαρίου, Ν. Βασιλειάδης, Π. Κεφαλάς, Δ. Σταμάτης, "Τεχνικές Λογικού Προγραμματισμού", Σύνδεσμος Ελληνικών Ακαδημαϊκών Βιβλιοθηκών, 20# http://hdl.handle.net/11419/777
- I. Bratko, "Prolog Programming for Artificial Intelligence", Third Edition, Addison-Wesley, 2000.
- L. Sterling, E. Shapiro, "The Art of Prolog", The MIT Press, 1994.
- J. W. Lloyd, "Foundations of Logic Programming", Springer Verlag, 1993