Languages for Artificial Intelligence

The course is a substitute for:

Languages for Artificial Intelligence (D36JUI)

Lecturer:

Karel Richta (gar.)

Tutor:

Karel Richta (gar.)

Supervisor:

Department of Computer Science and Engineering

Synopsis:

The course is intended for those interested in functional and logic

programming, which find most applications in solving problems of artificial

intelligence (AI). The course offers a profound acquaintance with

programming language Lisp and (to some level) with Prolog. Apart from

classical operation on list structures in Lisp, some modern features of

Common Lisp are included, as e.g. opeartions with vectors, hash tables as

well as object-oriented programming in Lisp.

Requirements:

As a homework, each student solves a problem from the domain of artificial intelligence or related fields of computer science. The results of homework and activity at seminars influence the overall course grading at the final exam.

Syllabus of lectures:

1. Languages used in AI, functional programming, recursive programming style

2. Basic data types and functions of Lisp

3. Lists and trees, type predicates, generalized variables

4. Recursion and iteration in Lisp, local and global references

5. Characters and strings, input, output

6. Lambda-expression, mapping functionals, control structures of Lisp

7. Macros, structures

8. Classes, objects

9. Vectors, arrays

10. Logic programming, syntax of data and program in Prolog

11. Predicates, clauses, facts, goal satisfaction, cut

12. Arithmetic predicates, list operations, term processing

13. Meta-logic predicates, input, output

14. Programming style, modifying the Prolog knowledge base

Syllabus of tutorials:

1. Recursive programming style, solving simple problems recursively in Pascal

2. Getting acquainted with the Lisp system in computer laboratory

3. Definining and debugging simple list functions in Lisp

4. Homework assignment

5. Recursive and iterative problem solving, efficiency of recursion

6. Mapping functionals and filters

7. Property lists of atoms, modifying pseudo-functions

8. Macros, structures

9. Object-oriented programming in Lisp

10. Consultation of homeworks

11. Getting acquainted with the Prolog system in computer laboratory

12. Recursion in Prolog, arithmetic and list predicates

13. Input, output, control of program execution

14. Homework evaluation, assessment

Study Objective:

Study materials:

1. Slade, S.: Object-Oriented Common Lisp. New Jersey: Prentice Hall PTR. 1997

2. Bratko, I.: PROLOG Programming for Artificial Intelligence. Reading, Mass.: Addison-Wesley. 1990

Note:

Time-table for winter semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue	roomKN:E-127 Richta K. 11:00–12:30 ODD WEEK (lecture parallel1) Karlovo nám. Kotkova cvičebna K4
Fri
Thu
Fri

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Computer Technology - Software Engineering- structured studies (compulsory elective course)
• Computer Technology - System Programming- structured studies (compulsory elective course)
• Computer Technology - Computer Graphics- structured studies (compulsory elective course)
• Computer Technology - Computer Network and Internet- structured studies (compulsory elective course)
• Computer Technology - Designing Digital Systems- structured studies (compulsory elective course)