INTELLIGENT AGENTS

Antonio DELLA CIOPPA INTELLIGENT AGENTS

0622700075
DIPARTIMENTO DI INGEGNERIA DELL'INFORMAZIONE ED ELETTRICA E MATEMATICA APPLICATA
EQF7
COMPUTER ENGINEERING
2020/2021

OBBLIGATORIO
YEAR OF COURSE 2
YEAR OF DIDACTIC SYSTEM 2017
SECONDO SEMESTRE
CFUHOURSACTIVITY
432LESSONS
18EXERCISES
18LAB
Objectives
KNOWLEDGE OF FORMAL METHODS FOR KNOWLEDGE REPRESENTATION, PROBLEM SOLVING STRATEGIES AND LEARNING PARADIGMS FOR MODELLING ARTIFICIAL AGENTS INTERACTING WITH CHANGING ENVIRONMENTS.

KNOWLEDGE AND UNDERSTANDING
METHODOLOGIES AND TOOLS FOR MODELLING ARTIFICIAL AGENTS. UNDERSTANDING THE RELATION AMONG KNOWLEDGE REPRESENTATION, PROBLEM SOLVING STRATEGIES AND LEARNING.

APPLYING KNOWLEDGE AND UNDERSTANDING
MAPPING METHODS AND TOOLS FOR SOLVING COMPLEX PROBLEMS. DESIGN AND IMPLEMENTATION OF ARTIFICIAL AGENTS. PERFORMANCE EVALUATION.

MAKING JUDGEMENTS
THE STUDENT WIL BE ABLE TO SELECT THE MOST SUITABLE METHODS AND TOOLS FOR PROVIDING SOLUTIONS TO COMPLEX PROBLEMS AND TO EVALUATE THE RELATIVE COST OF THE REQUIRED ACTIVITIES.

COMMUNICATION SKILLS
THE STUDENT WILL ACQUIRE THE SKILL FOR PRODUCING THE PROJECT REPORT AND FOR THE ORAL PRESENTATION OF THE PROJECT RESULTS USING THE PROPER TECHNICAL TERMINOLOGY AND THE APPROPRIATE SCIENTIFIC FORMALISM.
Prerequisites
ELEMENTS OF LOGICS, DESIGN OF ALGORITHM AND DATA STRUCTURE
Contents
INTRODUCTION
(LECTURE: 3H)
FUNDAMENTAL CONCEPTS: AGENT, ENVIRONMENT, PERFORMANCE - FOUNDATIONS: THEORY OF COMPUTATION - INTELLIGENT AGENT MODELS
PROBLEM SOLVING
(LECTURE: 6H; PRACTICE: 4H)
BLIND SEARCH STRATEGIES - INFORMED SEARCH STRATEGIES - LOCAL SEARCH AND OPTIMIZATION PROBLEMS - CSP
ADVERSARIAL SEARCH
(LECTURE: 4H; PRACTICE: 4H)
GAME THEORY - OPTIMAL DECISION - ALPHA-BETA PRUNING
LOGICAL AGENTS
(LECTURE: 4H)
PROPOSITIONAL LOGIC - THEOREM PROVING - MODEL CHECKING - AGENTS BASED ON PROPOSITIONAL LOGIC
FIRST ORDER LOGIC
(LECTURE: 6H)
SYNTAX AND SEMANTICS - USING FIRST ORDER LOGIC - KNOWLEDGE ENGINEERING AND FIRST ORDER LOGIC
INFERENCE IN FIRST ORDER LOGIC
(LECTURE: 6H)
PROPOSITIONAL VS FIRST ORDER INFERENCE - UNIFICATION AND LIFTING - FORWARD AND BACKWARD CHAINING - RESOLUTION
PROLOG
(LECTURE: 4H; LAB: 4H)
SYNTAX - HORN CLAUSES - UNIFICATION - RECURSION - BACKTRACKING
FINAL PROJECT (LECTURE: 3H)
Teaching Methods
THE COURSE INCLUDES LECTURES AND PRACTICE SESSIONS. DURING PRACTICE, SMALL STUDENT TEAMS ARE ASSIGNED EXERCISES THAT REQUIRED THE APPLICATION OF THE CONCEPT PRESENTED DURING THE LECTURE AND ARE DISCUSSED THE SOLUTIONS PROPOSED BY THE TEAMS. AT THE END OF THE CLASS, EACH TEAM MUST DEVELOP A PROJECT THAT INCLUDES INTO A UNITARY FRAMEWORK SOME OF THE TOPICS OF THE COURSE, AND IS INSTRUMENTAL FOR PROVIDING THE STUDENT WITH THE SKILL FOR APPLYING THE ACQUIRED KNOWLEDGE AND WORKING IN TEAM.
Verification of learning
THE FINAL EVALUATION IS BY ORAL EXAMINATION ON THE CONTENTS OF THE COURSE AND PRESENTATION OF THE PROJECT. THE GRADE IS THE WEIGHTED SUM OF PROJECT CONTENT (50%), PROJECT PRESENTATION (20%) AND ORAL EXAMINATION (30%)
Texts
S. RUSSELL, P. NORVIG, ARTIFICIAL INTELLIGENCE: A MODERN APPROACH, VOLUME I, PEARSON, 3 ED., 2009
L. STERLING, E. SHAPIRO, THE ART OF PROLOG, SECOND EDITION: ADVANCED PROGRAMMING TECHNIQUES, THE MIT PRESS, 1986
More Information
THE CLASS IS TAUGHT IN ITALIAN.
ADDITIONAL MATERIAL WILL BE AVAILABLE DURING THE CLASS ON THE COURSE WEBSITE

  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2022-05-23]