Tammet – 8. veebruar 2010, kell 22:52

2010-02-08T22:52:30Z

←Vanem redaktsioon		Redaktsioon: 9. veebruar 2010, kell 00:52
8. rida:		8. rida:
	Archives of previous years: [[itv0060 2008 arhiiv\|2008]], [[itv0060 2007 arhiiv\|2007]], [[itv0060 2006 arhiiv\|2006]], [http:/cs.ttu.ee/kursused/wav4130/ older].		Archives of previous years: [[itv0060 2008 arhiiv\|2008]], [[itv0060 2007 arhiiv\|2007]], [[itv0060 2006 arhiiv\|2006]], [http:/cs.ttu.ee/kursused/wav4130/ older].

	== <font color="red">NB! Siin on 2009 aasta arhiiv, mitte uus ja kehtiv info!</font> ==		<font color="red">NB! Siin on 2009 aasta arhiiv, mitte uus ja kehtiv info!</font>



	== <font color="red">Eksamitulemus</font> ==		== <font color="red">Eksamitulemus</font> ==

Tammet – 8. veebruar 2010, kell 22:52

2010-02-08T22:52:06Z

Uus lehekülg

Code: ITV0060 
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine or http://www.lambda.ee/index/itv0060 
Alternative names and codes:
* Tehisintellekti algoritmid ITT0020
* Intelligent Systems ITX8075
Lecturer: Tanel Tammet 
Contact: tammet@staff.ttu.ee, 6203457, TTÜ AK223 
Archives of previous years: [[itv0060 2008 arhiiv|2008]], [[itv0060 2007 arhiiv|2007]], [[itv0060 2006 arhiiv|2006]], [http:/cs.ttu.ee/kursused/wav4130/ older].

== NB! Siin on 2009 aasta arhiiv, mitte uus ja kehtiv info! ==

== Eksamitulemus ==

<pre>
Nimi Matrikk Prax Eksam Kokku Hinne
SJ 40602 40 75 85 4
RP 50606 40 78 86,8 4
MM 50947 35 65 74 3
AK 90206 20 20 32 0
AH 20576 20 50 50 1
RA 990746 40 90 94 5
SK 81897 40 40 64 2
DT 81928 35 42 60,2 2
TO 30633 40 90 94 5
RL 930711 40 60 76 3
KO 40980 40 30 58 1
MA 20446 40 82 89,2 4
KP 40645 40 67 80,2 4
DK 41008 40 40 64 2
AS 81889 35 80 83 4
AN 40 75 85 4
AV 50668 40 90 94 5
JS 50658 40 82 89,2 4
JV 81900 30 70 72 3
</pre>


== Materials for exam ==

Use and read the following

=== Philosophy around AI ===

Just for background, no questions during the exam:
* [[Media:intertehismoistus.PPT|internet ja tehismõistuse tekkimine]]
* [http://www.cs.yale.edu/homes/dvm/papers/conscioushb.pdf Artificial Intelligence and Consciousness: McDermott paper]

=== RDF, RDFS, OWL and conversion to 1st order logic ===

Understand RDF and RDFS:

* [http://en.wikipedia.org/wiki/Resource_Description_Framework RDF wikipedia]
* [http://www.w3.org/TR/rdf-primer/ w3c RDF primer]

Understand basics of owl:

* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]
* [http://www.w3.org/TR/owl-guide/ w3c OWL guide]

=== RDFa, reading and using RDF data from web pages ===

Understand main parts:

* [http://en.wikipedia.org/wiki/RDFa wiki intro]
* [[Media:portaalidekoosvoime.ppt]] or as pdf [[Media:portaalidekoosvoime.pdf]]
* [http://www.w3.org/2006/07/SWD/RDFa/primer/ w3c rdfa primer]
* [http://www.microformats.org microformats: a similar technology]

=== RDF relation to logic ===

Understand a bit of:

* [http://www.w3.org/TR/2003/NOTE-lbase-20031010/ Hayes & Guha Lbase]

=== Semantics of ordinary relational base ===

* [http://cs.ttu.ee/kursused/wav4130/rdftutapp.pdf rdf tutorial addendum for logic and dbases]

=== First order logic in query engines and planning ===

* [[Media:Geoffreasoningnotes.pdf|Geoff reasoning course notes]]
* [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]
* [[blocks world axiom/query examples from lecture]]

=== Different languages for 1st order logic: KIF, CL, restricted english jms ===

* [http://cl.tamu.edu/ CL main page],
* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]

=== Representing knowledge and belief ===

* [http://www.lambda.ee/index.php/Pilt:Ijcai93.pdf ijcai93 tutorial]

=== Fulltext indexes ===

* [http://www.lambda.ee/index.php/Pilt:Fulltext_indexes_good.ppt good intro and overview]

=== Term indexes ===

Understand basics of discrimination tree trie-type term indexes from

* [http://www.lambda.ee/index.php/Pilt:Schulz_indexing_overview.pdf schulz overview]
* [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper]

=== Game playing search (only for ITX8075) ===

* [http://en.wikipedia.org/wiki/Computer_chess computer chess from wikipedia]
* [http://www.engin.umd.umich.edu/CIS/course.des/cis579/ppt/lec3.ppt basic intro to game playing]

=== Learning (only for ITX8075) ===

Understand basics from detailed intros:
* [http://www.cs.toronto.edu/~hinton/csc2515/notes/lec1.ppt intro]
* [http://gamma.cs.unc.edu/rob-course/public_html/LEC/MachineLearningMethods.ppt robots/cars]

== Time, place, result ==

Semester: spring 
Grading: exam 
Points: 3.5 

Lectures: Every friday 8.00, room IT-140 
Practical work: every second (even weeks) Friday 10.00 room IT-213D 

Practical work will give 40% and exam 60% of points underlying the final grade. NB! Course ITV0060 and ITT0020 attendees may optionally do the third lab and get 60% from labs and 40% from exam.

== Practical work ==

* For ITV0060 and ITT0020: two labs on the same theme.
* For ITX8075: same two labs plus a third lab below.
* As noted above, course ITV0060 and ITT0020 attendees may optionally do the third lab and get 60% from labs and 40% from exam.

=== First lab ===

Date: 13 March.

Implement a system which can read html annotated according to the RDFa standard.
The data read should be saved and printed in several formats:
* csv
* rdf xml syntax

You will have to either find suitable annotated html pages or annotate some existing pages yourself (at least three pages).

Additional reading:

* http://www.w3.org/TR/rdf-primer/ RDF tutorial first parts
* http://en.wikipedia.org/wiki/RDFa wikipedia article on RDFa
* http://www.youtube.com/watch?v=ldl0m-5zLz4 and http://www.youtube.com/watch?v=mxE3FeOyS-E video tutorials of rdfa
* http://www.w3.org/TR/xhtml-rdfa-primer/
* http://www.w3.org/2006/07/SWD/RDFa/syntax/
* [[Media:portaalidekoosvoime.ppt]] või pdf kujul [[Media:portaalidekoosvoime.pdf]] (Estonian)

You may also look at some practical non-obligatory programming suggestions in Estonian: [[rdfa esimese praksi soovitusi]].

=== Second lab ===

Using the results of first lab for rule-based derivation of new information.

[[Details of the second lab: rule system]]

=== Third lab ===

This lab is obligatory only for the ITX8075 students obtaining 5 AP from the course! You can do it alone or together with another student: pairs are OK, three or more persons not. Both students must be present while presenting the result.

The lab depends on your background. Concretely, choose the first case which applies to you:

* You are studying in the IT department and have never programmed a turn-based two-player thinking game. In this case you should program the five-in-a-row game as explained in [[Praktikumitöö: mõtlemismäng 2005]]. This option is also allowed - but not obligatory - for non-IT students who have never programmed a two-player thinking game before.
* You are studying in the IT department and have programmed a turn-based two-player thinking game. In this case you should experiment with the [http://attempto.ifi.uzh.ch/site/ Attempto system] in the following way:
** Create a set of English sentences which covers the meaning of your rules from the second lab as closey as possible.
** Use the Attempto system to transform these sentences into a formal rule system.
** Write a program which would transform the sentences from the Attempto-given rule system into the form acceptable by Otter or Prover9.
* All the other cases: you will have to do a project from the similar [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-034Spring-2005/CourseHome/index.htm MIT course]. Download the MIT course materials and choose one of the following projects:
** http://ocw.mit.edu/NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-034Spring-2005/8C027A7F-EDDC-4E01-BEEF-55C94287ED15/0/dp1.pdf
** http://ocw.mit.edu/NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-034Spring-2005/27A74D7C-5492-4FC2-977C-00FF670C014A/0/dp2.pdf

== Course structure ==

=== Intro and paradigms of knowledge representation ===

1 lecture

Overview of knowledge representation: http://en.wikipedia.org/wiki/Knowledge_representation

* Procedural
* Declarative
** logic
** relational, network, object databases
** semantic networks
** frame systems
** property/value pairs
** rule/expert systems
** rdfs and owl

=== Core search, search in game trees ===

1 lecture

Lecture notes: http://www.lambda.ee/index.php/Pilt:Search.ppt

Additional material:

:* [http://en.wikipedia.org/wiki/Search_algorithm wikipedia article on search algorithms]
:* [http://en.wikipedia.org/wiki/A*_search_algorithm wikipedia article on the A* algorithm]
:* [http://aima.cs.berkeley.edu/newchap05.pdf Norvig AIMA constraint satisfaction chapter]
:* Minimax & alpha-beta: [http://en.wikipedia.org/wiki/Minimax minimax wikipedias], [http://en.wikipedia.org/wiki/Alpha-beta_pruning a-b in wikipedia], [http://www.ocf.berkeley.edu/~yosenl/extras/alphabeta/alphabeta.html applet demo], [http://www.emunix.emich.edu/~evett/AI/AlphaBeta_movie/sld001.htm a-b ok explanation with]
:* Chinook: http://www.cs.ualberta.ca/~chinook/
:* Ph.D. thesis about game programming: http://fragrieu.free.fr/SearchingForSolutions.pdf

=== Logic ===

2 lectures

* propositional, first order, higher order
* semantics/models
* proofs and deriving new information
* automated reasoning
* relational data and rdf in first order logic

=== Planning ===

1 lecture

logic- and reasoning-based methods

=== Different property/value pair representations ===

Methods and their relations

1 lecture

* association lists
* google base
* RDF
* XML

=== Specific versions of 1st order logic and rule systems ===

1 lecture

* KIF
* CL
* ontologies
* wordnet
* cyc
* restricted english systems

=== Details of RDF, RDFS, RDFa ===

1 lecture

=== OWL ===

1 lecture

=== Representing time, probability, epistemics, context ===

1 lecture

=== Search and indexing ===

2 lecture

=== Learning ===

1 lecture

Useful materials:

* [http://www.cs.toronto.edu/~hinton/csc2515/notes/lec1.ppt intro]
* [http://gamma.cs.unc.edu/rob-course/public_html/LEC/MachineLearningMethods.ppt robots/cars]
* [http://www.cs.toronto.edu/~hinton/csc2515/notes/lec4.ppt backpropagation]
* [http://www.cs.toronto.edu/~hinton/csc2515/lectures.html good set of lecture materials]
* [http://www.cs.cmu.edu/~tom/mlbook-chapter-slides.html another good full set of lecture materials]
** sh [http://www.cs.cmu.edu/afs/cs.cmu.edu/project/theo-20/www/mlbook/ch4.pdf neural netw chapter]

[[Category:Kursus]]

Itv0060 2009 arhiiv - Redigeerimiste ajalugu

Tammet – 8. veebruar 2010, kell 22:52

Tammet – 8. veebruar 2010, kell 22:52