====== Lectures — ae4b33flp ======
( [[start | home]] | lectures | [[tutorials | tutorials]] | [[.:2013:assignments | homework]] )
[[Scheme]] ^ No. ^ Date ^ Topic ^ ^ [[scheme#Scheme_Lecture_1|1.]] ^ //23.2.// | Introduction to declarative programming languages. Comparison to classical imperative languages. Introduction to programming for artificial intelligence. | ^ [[scheme#Scheme_Lecture_2|2.]] ^ //2.3.// | Lisp and Scheme: basic language idioms, atoms, lists, recursion. | ^ [[scheme#Scheme_Lecture_3|3.]] ^ //9.3.// | Scheme: lambda abstraction, built-in functions, advanced data structures. | ^ [[scheme#Scheme_Lecture_4|4.]] ^ //16.3.// | Scheme: relations between iterations and tail recursion optimisations guaranteed by the language standard, built-in high-order functions. | ^ [[scheme#Scheme_Lecture_5|5.]] ^ //23.3.// | Scheme: state space search, applications in artificial intelligence. | [[Haskell]] ^ No. ^ Date ^ Topic ^ ^ [[haskell#Haskell_Lecture_6|6.]] ^ //30.3.// | Haskell: types, patterns, built-in functions, lambda abstraction. | ^ [[haskell#Haskell_Lecture_7|7.]] ^ // 6.4.// | Haskell: advanced properties of the language in comparison to Scheme. | Prolog (we follow Peter Flach's {{http://www.cs.bris.ac.uk/~flach/SimplyLogical.html|Simply Logical course book}}) ^ No. ^ Date ^ Topic ^ ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter1.pdf|8.}} ^ //13.4.// | Prolog: facts, rules and queries. Recursion. Query answering. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter1.pdf|9.}} ^ //20.4.// | Prolog: functions and list operations (SL chapter 1 cont'd) | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter2.pdf|10.}} ^ //27.4.// | Prolog and logic: clauses, Herbrand base, interpretation, model, closed-world assumption, decidability. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter3.pdf|11.}} ^ //4.5.// | Cut and negation. Extralogical operators, arithmetics. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter5.pdf|12a.}} {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter6.pdf|12b.}} ^ //18.5.// | Combinatorial search in Prolog. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter9.pdf|13.}} ^ //25.5.// | Inductive reasoning in logic | {{:courses:ae4b33flp:prolog-model_questions.pdf|}} Three exemplary examination questions (Prolog part)