Introduction to Artificial Intelligence

Course description

  • Introduction to Artificial Intelligence, examples of applications
  • State space and basic search algorithms: depth-first, breadth-first and iterative deepening, complexity of these algorithms
  • Heuristic search, algorithms A* and IDA*, admissibility theorem for A*, properties of heuristic function and analysis of time and space complexity
  • Problem decomposition with AND/OR graphs, search in AND/OR graphs, heuristic search algorithm AO*
  • Machine learning: problem of learning from data, data mining, description languages and hypothesis spaces, induction of decision trees, regression trees, model trees, and rules. Software tools for machine learning and applications.
  • Knowledge representation and expert systems: knowledge representation with rules, frames, semantic networks, ontologies; inference algorithms and generationg explanation; handling uncertain knowledge, Bayesian networks
  • Means-ends planning, total-order and partial-order planning, goal regression, applications in robotics and logistics

Objectives and competences

  • Teach basic concepts, ideas, methods and techniques of artificial intelligence (AI)

  • Ability to solve problems with methods of artificial intelligence

  • Ability to understand the literature in the area of AI

  • Contribute to the understanding of the relevance of technical achievements of AI with respect to their implications in philosophy and psychology

Learning and teaching methods

Lectures, laboratory exercises, homework, individual and team projects

Intended learning outcomes

After the completion of the course the student will be able to:

– know the basic and most commonly used methods in the field of artificial intelligence (AI),

– explain implications of the AI achievements, and its relation with cognitive science, psychology, medicine, logic, mathematics and other related fields,

– define the technical boundaries of the field,

– use the search and machine learning algorithms on real problems,

– compare time and spatial complexity of the taught algorithms,

– formulate selected problems from the real world as problems that are solvable with the AI algorithms.

Reference nosilca

  1. ZUPANC, Kaja, BOSNIĆ, Zoran. Automated essay evaluation with semantic analysis. Knowledge-based systems, ISSN 0950-7051. [Print ed.], Mar. 2017, vol. 120, str. 118-132.
  2. OCEPEK, Uroš, RUGELJ, Jože, BOSNIĆ, Zoran. Improving matrix factorization recommendations for examples in cold start. Expert systems with applications, ISSN 0957-4174. [Print ed.], Nov. 2015, vol. 42, no. 19, str. 6784-6794.
  3. BOSNIĆ, Zoran, DEMŠAR, Jaka, KEŠPRET, Grega, Rodrigues, Pedro Pereira, Gama, João, Kononenko, Igor. Enhancing data stream predictions with reliability estimators and explanation. Engineering applications of artificial intelligence, ISSN 0952-1976. [Print ed.], 2014, vol. 34, str. 178-192.
  4. BOSNIĆ, Zoran, KONONENKO, Igor. Estimation of individual prediction reliability using the local sensitivity analysis. Applied intelligence, ISSN 0924-669X. [Print ed.], Dec. 2008, vol. 29, no. 3, str. 187-203, ilustr.
  5. BOSNIĆ, Zoran, KONONENKO, Igor. Comparison of approaches for estimating reliability of individual regression predictions. Data & Knowledge Engineering, ISSN 0169-023X. [Print ed.], Dec. 2008, vol. 67, no. 3, str. 504-516.

Celotna bibliografija je dostopna na SICRISu / For complete bibliography see SICRIS:

Study materials

. Bratko, Prolog Programming for Artificial Intelligence, 4th edition, Pearson Education,

Addison-Wesley 2011, ISBN: 0201403757.

S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third edition, Pearson

Education, Prentice-Hall 2010, ISBN: 0136042597.

I. Bratko, Prolog in umetna inteligenca, Založba FE in FRI, ponatis 2011.

I. Kononenko, Strojno učenje, Založba FE in FRI, 2005.

Materiali na spletu (Spletna učilnica FRI; Ivan Bratko home page): Prosojnice predavanj, naloge.

Bodi na tekočem

Univerza v Ljubljani, Fakulteta za elektrotehniko, Tržaška cesta 25, 1000 Ljubljana

E: T:  01 4768 411