Person in charge: | (-) |
Others: | (-) |
Credits | Dept. | Type | Requirements |
---|---|---|---|
9.0 (7.2 ECTS) | CS |
|
ADA
- Prerequisite for DIE , DCSYS IL - Prerequisite for DIE , DCSYS , DCSFW |
Person in charge: | (-) |
Others: | (-) |
This subject presents an array of problems that are dealt with in artificial intelligence, as well as the theoretical foundations of AI and its general applications. The subject focuses on the two basic areas of artificial intelligence: problem solving (including state space, Heuristic search and Constraint Satisfaction), and the Knowledge representation. To round out this approach, students will also be introduced to two topics that currently have a more important presence in practical applications and research: the Natural Language Processing and Knowledge-Based Systems. The subject has a practical focus.
Estimated time (hours):
T | P | L | Alt | Ext. L | Stu | A. time |
Theory | Problems | Laboratory | Other activities | External Laboratory | Study | Additional time |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
2,0 | 0 | 1,0 | 0 | 0 | 0 | 0 | 3,0 | |||
History, reasons for, and descriptions of the various AI fields.
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
5,0 | 5,0 | 1,0 | 0 | 4,0 | 9,0 | 0 | 24,0 | |||
Introduction to techniques for representing knowledge. Reasons for representing knowledge. Procedural representations and production systems. Structured representations, frames and ontologies.
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
9,0 | 6,0 | 6,0 | 0 | 28,0 | 10,0 | 0 | 59,0 | |||
Introduction to knowledge-based systems. Need for knowledge to resolve complex problems. Relationship with representation techniques, special features. Knowledge Engineering. Learning. Approximate reasoning.
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
7,0 | 4,0 | 0 | 0 | 0 | 9,0 | 0 | 20,0 | |||
Introduction to natural language processing. Language levels. Lexical and morphological analysis. Syntactic and semantic analysis. Definite clause grammars. Applications.
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
2,0 | 0 | 0 | 0 | 0 | 0 | 0 | 2,0 | |||
We introduce the need of learning to raise the capacities of the knowledge-based systems and to solve problems that would have a very high cost if they weren"t solved in an automated way.
|
Total per kind | T | P | L | Alt | Ext. L | Stu | A. time | Total |
38,0 | 26,0 | 14,0 | 0 | 60,0 | 38,0 | 0 | 176,0 | |
Avaluation additional hours | 4,0 | |||||||
Total work hours for student | 180,0 |
The classes are split into theory, problem, and lab sessions. The theory sessions develop the core knowledge of the course. The classes of problems let students delve into the techniques and algorithms explained in the theory sessions in greater depth.
The lab classes involve small practical assignments using tools and languages appropriate for AI purposes. This work practices and builds on the knowledge imparted in the theory classes.
Assessment is based on a part exam, a final exam, and a lab grade.
The mid-term exam will not confer any exemption and will be held in class hours. Students failing to sit or pass the part exam will only be assessed on their performance in the final exam.
The lab grade will be based on student reports on the practical work.
The final grade will be calculated as follows:
Final Grade = max (part exam grade * 0.15 + Final exam grade * 0.55, Final exam grade * 0.7) + Lab grade * 0.3
- Basic concepts of propositional logic and first order logic
- Ability to formulate problems in terms of logic.
- Logical inference. Resolution. Resolution strategies.
- Tree and graph structures, shortest-path and search algorithms.
- Basic principles of complexity.
Accordingly, students should have passed IL and ADA before taking the AI course.