Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel

Viimane redaktsioon: 30. jaanuar 2019, kell 09:14

Code: ITV0060
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine or http://www.lambda.ee/index/itv0060
Lecturer: Tanel Tammet
Contact: tanel.tammet@ttu.ee, 6203457, TTÜ ICT-426
Archives of previous years: 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, older.

NB! This is an archive from 2015

Exam

Date and time (two separate occasions):

2. June (Tuesday) at 10:00 in room SOC-214 (Majandus- ja sotsiaalteaduste maja)
9. June (Tuesday) at 10:00 in room SOC-210 (Majandus- ja sotsiaalteaduste maja)

4 questions, one for each block. Each question is a small task in encoding information. No programming excersices.

1. task: encoding data in a conventional relational database in RDF, inventing suitable ID-s, converting selects with where conditions and joins to first order rule form.

2. task: encoding data/rules in RDFs (perhaps additionally in RDFa). Writing 1st order rules about the meaning of RDFs built-in axioms and deriving data using RDFs built-in axioms. Concrete derivation systems are not required: just deriving correct information. It is also important to understand ways to uri-s as global id-s and encoding data in both html metainfo part and in pages, using RDFa.

3. task: encoding uncertain knowledge. You will first have to encode a small scenario using several different systems: default logic, probabilistic logic, fuzzy logic. Second, you have to show what can you derive using one or another formalism.

4. tasks: building indexes. Given a small dataset(s), you will have to build several indexes. Which indexes: trie indexes for words in a text, discrimination tree indexes for generalizations of terms, path indexes for concretisations of terms. For the latter two, use the mccune paper

NB! The information in the following "this is in exam ..." is old and not relevant.

Time, place, result

Semester: spring
Grading: exam

Lectures: every Monday 16:00-17.30, room ICT-A1
Practical work: Mondays on odd weeks (2. Feb, 16 Feb, ...) 17:45-19:15 room ICT-403
Practical work will give 40% and exam 60% of points underlying the final grade. The exam will consist of several small excercises.

Focus

The main focus of the course is on KR (knowledge representation): how to represent nontrivial information in programs and databases, how to build and use indexes for efficient search through large sets of knowledge. Check out this description.

The course contains four blocks built on each other:

Background and basics. Representing simple facts.
Representing rules.
Time, planning and uncertain knowledge.
Indexes and search.

Books to use:

Ca half of the course themes are covered in this book with freely accessible pdf-s.
The freely accesible pdf of the handbook if knowledge representation gives a detailed and thorough coverage of the subject; far more than necessary for the course.
Interesting to browse: recent conference proceedings
Interesting to browse: course materials, course materials

Observe that a noticeable part of the course contents are not covered by these books: use the course materials and links to papers, standards and tutorials provided.

Practical work

There are three labs: the first two are obligatory, third is optional. The labs have to be presented to the prof and all students present at labwork.

First lab 2015

The goal of the first lab is to write a software system able to scrape factual raw data about an address (like "Akadeemia tee 12, Tallinn") given to the program.

Basically, search for web pages containing the name or similar names and extract relevant words from the list you create: words closer to the name and with more occurrences are also more important/better match. Titles/headlines above the word are also more likely to be important. It may be a good idea to do some searches together with interesting keywords already. Also, whenever you do a search / pull a page, it is a good idea to store the search result / html source in a file to avoid exchausting your search quota and just wasting bandwidth and time,

It makes sense to search adresses in several ways: googling, binging plus searching from known real estate portals.

Deadline: 16. March (after this there will be a penalty).

Second lab 2015

The goal of the second lab is to write and use rules to categorize/tag addresses according to the data obtained during the first lab. An address should get a number of tags with numerical indicators showing our trust in that the tag really applies to the address, plus (sometimes) a number indicating the degree to which the tag applies.

See details for KR lab 2.

Third lab 2014

This lab is optional and will simply give as many points as lab 1 or 2 towards the final result and the grade: practical wotrk 60% and exam 40%.

The goal of the lab is to use wordnet or teksaurus to create an additional ruleset and to use that in addition to your own rules in lab 2.

Lab ideas

KR lab idea by Priit Järv

Student ideas are also welcome: have to agree with Tanel first.

A cool idea is to investigate:

Lecture block 1: basics and representing simple facts.

Lecture 1 (2. Feb) Overview of the course. Background and basics. First lab.

Lecture materials:

Intro lecture: declarative and procedural representations
Core logic refresher.
Details of the first lab.

Lecture 2 (9 Feb) Programming and databases. SQL: meaning and representation of facts

Encoding data in programming languages.
relation of plain data in databases to logic & representing complex structures in databases
Core ideas of non-relational databases, mostly RDF

Lecture materials:

Lecture 3 (16 Feb) HTML annotations. Microformats, microdata, RDFa

Two student presentations ca 30 min each:

Microformats, microdata, RDFa: Madis Taimre
Facebook open graph: Madis Allikmaa

Lecture materials:

Html annotations

Understand main parts:

Lecture 4 (2. March) RDF last parts + RDFS start

Continuing with RDF:

Continue with the lecture material key/value pairs and rdf, compared to the relational model
Check out http://www.w3.org/RDF/ and http://www.w3.org/standards/techs/rdf#w3c_all
And read more from http://www.w3.org/TR/rdf11-primer/ and http://www.w3.org/TR/rdf11-new/

Starting RDFS:

Start with the lecture material RDFS: rdf schema and as ppt
Read RDFs wikipedia
Check out w3c RDF schema

Choosing the student presentations from:

Nosql links and notes

Lecture block 2: representing rules

Lecture 5 (9. March) Student presentations on NELL and nosql databases + intro to the second lab

Student lectures on the theme of data and knowledge extraction from the web:

Nell and systems like Nell (are there any? Check also ConceptNet): Andrei. See some details about Nell as a nice example.
Student presentations chosen from Nosql links and notes:
- Rait: docs.mongodb.org/manual/ (tehtud)
- Raigo: http://www.neo4j.org/ (tehtud)

Understand RDFS:

Lecture material:

Continue with RDFS: rdf schema and as ppt

Additional details (not part of exam):

Lecture 6 (16. March) continuing RDFs and looking into other KR languages

Lecture material:

Continue with RDFS: rdf schema and as ppt

Additional details (not part of exam):

Important KR languages:

RuleML RuleML
OWL OWL wikipedia, w3c OWL guide
KIF
CL CL main page,
ontologies
wordnet
cyc
TPTP language TPTP

Lecture 7 (23. March): OWL and ontologies

Owl background: description logics (not part of exam )

description logic intro
brief alternative intro to description logic
detailed course in description logics (not necessary for exam)

Understand basics of owl:

OWL wikipedia

not part of exam:

Notes about RDF and OWL: logical meaning

Start looking at interesting ontologies:

Lecture 8 (30 March): Restricted english

Attempto restricted english as intro use this talk
Inform system for interactive fiction, vt ka vanemat raamatut

Attempto details not necessary for the exam.

Lecture block 3: time, planning and uncertain knowledge

Rules in planning and robotics

Lecture material:

Logic for uncertain knowledge

nonmonotonic logic Not necessary for exam.
default logic For exam: main material for default logic.

For the exam: you should be able to create and solve small examples with default logic.

Fuzzy and probabilistic logic

Uncertain_prob_fuzzy.ppt‎ Intro.
Vienna_tanel_2.pdf Additional examples and combining.

For the exam: understand the differences between fuzzy and probabilistic logic and be able to present small examples.

Logic of belief and knowledge

Ijcai93.pdf Overview.

For exam: understand referential transparency and core ideas about encoding belief and knowledge. Modal logic not necessary for the exam.

Lecture block 4: indexes and search

27. April. Indexes: intro and mainstream

Traditional database indexes incl B+ tree:

G. Molina lecture 4

Hash indexes:

wiki.

Bitmap indexes:

wiki.

For exam: understand the core usage scenarios and be able to create small examples.

4. May Multi-field and geoindexes, fulltext and term indexes

A few words about both multi-field indexes and geoindexes.
Fulltext indexes: good intro and overview
Term indexes: mccune paper

NB! Presentation: geoindexes, 4. May, Daniel.

not part of exam:

4. May: Fancier term indexes

Path indexes

On from here.

11 May: Nosql indexes plus information about the exam

Document bases
Graph bases

NB! Indexing in Graph and Document (nosql) databases. 11. May: Vassili.

NB! Last day for the practical work presentations.

About the exam.

18. May: guest lecture

Kalle Tomingas. Impact analysis and ontologies.

http://demo.dlineage.com

teadmised_note

Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel

Viimane redaktsioon: 30. jaanuar 2019, kell 09:14

Sisukord

NB! This is an archive from 2015

Exam

Time, place, result

Focus

Practical work

First lab 2015

Second lab 2015

Third lab 2014

Lab ideas

Lecture block 1: basics and representing simple facts.

Lecture 1 (2. Feb) Overview of the course. Background and basics. First lab.

Lecture 2 (9 Feb) Programming and databases. SQL: meaning and representation of facts

Lecture 3 (16 Feb) HTML annotations. Microformats, microdata, RDFa

Lecture 4 (2. March) RDF last parts + RDFS start

Lecture block 2: representing rules

Lecture 5 (9. March) Student presentations on NELL and nosql databases + intro to the second lab

Lecture 6 (16. March) continuing RDFs and looking into other KR languages

Lecture 7 (23. March): OWL and ontologies

Lecture 8 (30 March): Restricted english

Lecture block 3: time, planning and uncertain knowledge

Rules in planning and robotics

Logic for uncertain knowledge

Fuzzy and probabilistic logic

Logic of belief and knowledge

Lecture block 4: indexes and search

27. April. Indexes: intro and mainstream

4. May Multi-field and geoindexes, fulltext and term indexes

4. May: Fancier term indexes

11 May: Nosql indexes plus information about the exam

18. May: guest lecture

Navigeerimismenüü

@@ 7. rida: / 7. rida: @@
 Code: <b>ITV0060</b><br>
 Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine  or http://www.lambda.ee/index/itv0060<br>
-Lecturer: Kalle Tomingas, Tanel Tammet<br>
+Lecturer: Tanel Tammet<br>
-Contact: kalle.tomingas@gmail.com, 50 40 568<br>
+Contact: tanel.tammet@ttu.ee, 6203457, TTÜ ICT-426<br>
-tammet@staff.ttu.ee, 6203457, TTÜ AK223<br>
+Archives of previous years: [[itv0060 2014 arhiiv|2014]], [[itv0060 2013 arhiiv|2013]], [[itv0060 2012 arhiiv|2012]], [[itv0060 2011 arhiiv|2011]], [[itv0060 20010 arhiiv|2010]], [[itv0060 2009 arhiiv|2009]], [[itv0060 2008 arhiiv|2008]], [[itv0060 2007 arhiiv|2007]],   [[itv0060 2006 arhiiv|2006]], [http://cs.ttu.ee/kursused/wav4130/ older].
-Archives of previous years: [[itv0060 2011 arhiiv|2011]], [[itv0060 20010 arhiiv|2010]], [[itv0060 2009 arhiiv|2009]], [[itv0060 2008 arhiiv|2008]], [[itv0060 2007 arhiiv|2007]],   [[itv0060 2006 arhiiv|2006]], [http:/cs.ttu.ee/kursused/wav4130/ older].
 </td>
 </tr>
 </table>
-== <font color="red">Exam and additional time for presentations</font> ==
+== <font color="red">NB! This is an archive from 2015</font> ==
-Extra time for second lab presentations:
+== Exam ==
-* 21. May (Monday) standard time 17.45
+Date and time (two separate occasions):
-Two times available (choose one):
+* 2. June (Tuesday) at 10:00 in room <b>SOC-214</b> (Majandus- ja sotsiaalteaduste maja)
+* 9. June (Tuesday) at 10:00 in room <b>SOC-210</b> (Majandus- ja sotsiaalteaduste maja)
-* 1. June (Friday) at 9.00-12.00, room II-102
+questions, one for each block. Each question is a small task in encoding information. No programming excersices.
-* 8. June (Friday) at 9.00-12.00, room II-102
+* 1. task: encoding data in a conventional relational database in RDF, inventing suitable ID-s, converting selects with where conditions and joins to first order rule form.
+* 2. task: encoding data/rules in RDFs (perhaps additionally in RDFa). Writing 1st order rules about the meaning of RDFs built-in axioms and deriving data using RDFs built-in axioms. Concrete derivation systems are not required: just deriving correct information. It is also important to understand ways to uri-s as global id-s and encoding data in both html metainfo part and in pages, using RDFa.
+* 3. task: encoding uncertain knowledge. You will first have to encode a small scenario using several different systems: default logic, probabilistic logic, fuzzy logic. Second, you have to show what can you derive using one or another formalism.
+* 4. tasks: building indexes. Given a small dataset(s), you will have to build several indexes. Which indexes: trie indexes for words in a text, discrimination tree indexes for generalizations of terms, path indexes for concretisations of terms. For the latter two, use the [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper]
+NB! The information in the following "this is in exam ..." is old and not relevant.
 == Time, place, result ==
@@ 30. rida: / 40. rida: @@
 Semester: spring<br>
 Grading: exam<br>
-Points: 3.5<br>
-Lectures: every Monday 17.45-19.15, room IT-137a<br>
+Lectures: every Monday 16:00-17.30, room ICT-A1<br>
-Practical work: Mondays on odd weeks 19.15-20.00, room IT-137a:<br>6 feb, 20 feb, 5 mar, 19 mar, 2 apr, 16 apr, 30 apr, 14 may, 21 may.
+Practical work: Mondays on odd weeks (2. Feb, 16 Feb, ...) 17:45-19:15 room ICT-403<br>
+Practical work will give 40% and exam 60% of points underlying the final grade.
+The exam will consist of several small excercises.
-Practical work will give 40% and exam 60% of points underlying the final grade.
+== Focus ==
+The main focus of the course is on KR ([https://en.wikipedia.org/wiki/Knowledge_representation knowledge representation]): how to represent nontrivial information in programs and databases, how to build and use indexes for efficient search through large sets of knowledge. Check out [http://www.lisperati.com/tellstuff/ this description].
-== Practical work ==
+The course contains four blocks built on each other:
-There are two labs on the same theme and an optional third lab.
+* Background and basics. Representing simple facts.
+* Representing rules.
+* Time, planning and uncertain knowledge.
+* Indexes and search.
-=== First lab ===
+Books to use:
-The main goal of the first lab is to web-scrape data from the public sources using search engines and simple text analysis/statistics.
+* Ca half of the course themes are covered in [http://www.sciencedirect.com/science/book/9781558609327 this book] with freely accessible pdf-s.
+* The freely accesible pdf of the [http://ii.fmph.uniba.sk/kri/KRhandbook.pdf handbook if knowledge representation] gives a detailed and thorough coverage of the subject; far more than necessary for the course.
+* Interesting to browse: [http://www.aaai.org/Library/KR/kr12contents.php recent conference proceedings]
+* Interesting to browse: [http://www.cse.buffalo.edu/~shapiro/Courses/CSE563/Slides/krrSlides.pdf course materials], [http://web.stanford.edu/class/cs227/ course materials]
-Details in [[Teadmised first lab 2012|Teadmised first lab 2012]]. The lab should be completed by March, later presentation will cut the points to half.
+Observe that a noticeable part of the course contents are not covered by these books: use the course materials and links to papers, standards and tutorials provided.
-=== Second lab ===
+== Practical work ==
-The main goal of the second lab is to augment data obtained from the first lab by writing and using probabilistic rules with a rule engine.
+There are three labs: the first two are obligatory, third is optional. The labs have to be presented to the prof and all students present at labwork.
-Details about second lab will be available on beginning of April. Previous year lab can be seen here: [[Teadmised second lab 2012]]. You may also have a look at the 2011 version of the lab [[Teadmised second lab 2011]].
+=== First lab 2015 ===
-=== Optional third lab ===
+The goal of the first lab is to write a software system able to scrape factual raw data about an address (like "Akadeemia tee 12, Tallinn") given to the program.
-The optional third lab can be done in parallel with the second. It will be a relatively complex lab: successful passing will give additional 20 points, thus the weight of the exam is diminished from 60% to 40% of the overall score.
+Basically, search for web pages containing the name or similar names and extract relevant words from the list you create: words closer to the name and with more occurrences are also more important/better match. Titles/headlines above the word are also more likely to be important. It may be a good idea to do some searches together with interesting keywords already. Also, whenever you do a search / pull a page, it is a good idea to store the search result / html source in a file to avoid exchausting your search quota and just wasting bandwidth and time,
-What to do: use Attempto to create a system such that you can write rules and/or facts and/or queries for the second lab in restricted english. These restricted english sentences have to be automatically converted to the form usable by Otter. It is a good idea to avoid probabilities in these rules, since it would be very hard to encode probabilities using attempto.
+It makes sense to search adresses in several ways: googling, binging plus searching from known real estate portals.
+Deadline: <b>16. March</b> (after this there will be a penalty).
-See: http://attempto.ifi.uzh.ch/site/ , http://attempto.ifi.uzh.ch/ape/
+See also [[notes for KR lab 1]].
-== Materials to study for the exam ==
+=== Second lab 2015 ===
-Eksamiküsimused:
+The goal of the second lab is to write and use rules to categorize/tag addresses according to the data obtained during the first lab. An address should get a number of tags with numerical indicators showing our trust in that the tag really applies to the address, plus (sometimes) a number indicating the degree to which the tag applies.
-Väikesed ülesanded: data ja reeglite
-esitamine ja kasutamine
-Andmebaas nö tüüpilise relatsioonilise
+See [[details for KR lab 2]].
-mudelina, key-value ja rdf kujul
-Ülesanne blocks worldist: esita mingi
+=== Third lab 2014 ===
-olukord, mingi reegel ja näita rakendamise
-tulemust
-RDF, RDFS ja OWL põhiasjad: väike
+This lab is <b>optional</b> and will simply give as many points as lab 1 or 2 towards the final result and the grade: practical wotrk 60% and exam 40%.
-ülesanne. Süntaksid ja eridetailid
-ei ole olulised.
-RDF ja RDFS esitada loogikas
+The goal of the lab is to use [http://wordnet.princeton.edu/ wordnet] or [http://www.cl.ut.ee/ressursid/teksaurus/ teksaurus] to create an additional ruleset and to use that
-faktide ja reeglitena, mõni
+in addition to your own rules in lab 2.
-lihtne OWLi näide võib ka olla
-Arusaamine RDFa põhiasjadest, oskus
+=== Lab ideas ===
-teha näidet.
-MÕni üldküsimus Nelli ja Attempto
+* [[KR lab idea by Priit Järv]]
-kohta.
-Arusaam et mis on mittemonotoonne
+Student ideas are also welcome: have to agree with Tanel first.
-loogika ja mis ei ole, mis oleks
-viisid esitada vasturääkivaid
-teadmisi. Võib olla väike ülesanne
-mingite asjade esitamise kohta: näide
-ja selgitus.
-Default loogika ülesanne a la linnud
+A cool idea is to investigate:
-ja Quaker diamond: panna kirja reeglid
+* http://threatpost.com/fbstalker-automates-facebook-graph-search-data-mining
-ja viia läbi järeldused ja vbl selgitada
+* https://github.com/milo2012/osintstalker
-lisaks. Seos CWA, Prolog ja default loogika
-vahel võib samuti küsimuse alla tulla.
-Indeksid: arusaam baasindekseerimis-ideedest
-ja B+ treest. Ntx ehitada B+ mingi
-väikese datahulga jaoks. Sama hashi kohta
-ja bit indeksite kohta. Eriteemad a la
-indeksi pakkimine ja erinevad hashi
-viisid ei tule teemaks.
-Täistekstiindeksid: osata ehitada näite
-pealt. Vt presentatsioonist erinevaid
-viise, ntx Patricia trie.
-Termiindeksid: piisab discrimination
-tree indeksist ja näite põhjal
-indeksi ehitamisest.
+== Lecture block 1: basics and representing simple facts. ==
-=== Declarative and procedural representations ===
+=== Lecture 1 (2. Feb) Overview of the course. Background and basics. First lab.  ===
-Lecture material:
+Lecture materials:
 * [[Media:Kr intro.ppt | Intro lecture: declarative and procedural representations]]
+* Core logic refresher.
+* Details of the first lab.
-=== Databases: meaning and representation of facts ===
+=== Lecture 2 (9 Feb) Programming and databases. SQL: meaning and representation of facts ===
+* Encoding data in programming languages.
 * [[Media:Kr_plain_data_db_logic.ppt | relation of plain data in databases to logic & representing complex structures in databases ]]
-* [[Media:Kr_rdf_schemalessdb_3.pdf|key/value pairs and rdf, compared to the relational model]]
+* Core ideas of non-relational databases, mostly RDF
-=== Rules in logic: apps in planning, robotics, ... ===
+Lecture materials:
-Lecture material:
+* Start with [[Media:kr_rdf_schemalessdb_3_2.ppt|key/value pairs and rdf, compared to the relational model]]
-* [[Media:Kr_rules1.pdf|Rules and logic: refresher]] and as [[Media:Kr_rules1.ppt|ppt]]
+* [[Nosql links and notes]]
-See also:
+=== Lecture 3 (16 Feb) HTML annotations. Microformats, microdata, RDFa  ===
-* [[Media:Geoffreasoningnotes.pdf|Geoff reasoning course notes: just for background, no questions in exam]]
+Two student presentations ca 30 min each:
-* [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]
-* [[blocks world axiom/query examples from lecture]]
+* Microformats, microdata, RDFa: Madis Taimre
+* Facebook open graph: Madis Allikmaa
-=== RDF, RDFS, OWL and conversion to 1st order logic ===
+Lecture materials:
-Lecture material:
+* [[Media:Kr_html_annotations.ppt|Html annotations]]
-* [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]]
-Understand RDF and RDFS:
+Understand main parts:
-* [http://en.wikipedia.org/wiki/Resource_Description_Framework RDF wikipedia]
+* [https://support.google.com/webmasters/answer/99170?hl=en Google rich snippets]
-* [http://www.w3.org/TR/rdf-primer/ w3c RDF primer]
+* [http://en.wikipedia.org/wiki/RDFa wiki intro]
+* [http://www.w3.org/TR/rdfa-lite/ RDFa lite] ja [http://www.w3.org/TR/xhtml-rdfa-primer/ w3c rdfa primer]
+* [http://ogp.me/ open graph protocol (i.e. Facebook stuff)]
+* [http://microformats.org/ microformats]
+* [[Media:portaalidekoosvoime.ppt]] or as pdf [[Media:portaalidekoosvoime.pdf]]
-Understand basics of owl:
+=== Lecture 4 (2. March) RDF last parts + RDFS start ===
-* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]
+Continuing with RDF:
-* [http://www.w3.org/TR/owl-guide/ w3c OWL guide]
-=== RDFa, reading and using RDF data from web pages ===
+* Continue with the lecture material [[Media:kr_rdf_schemalessdb_3_2.ppt|key/value pairs and rdf, compared to the relational model]]
+* Check out http://www.w3.org/RDF/ and http://www.w3.org/standards/techs/rdf#w3c_all
+* And read more from http://www.w3.org/TR/rdf11-primer/ and http://www.w3.org/TR/rdf11-new/
-Understand main parts:
+Starting RDFS:
-* [http://en.wikipedia.org/wiki/RDFa wiki intro]
+* Start with the lecture material [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]]
-* [[Media:portaalidekoosvoime.ppt]] or as pdf [[Media:portaalidekoosvoime.pdf]]
+* Read [http://en.wikipedia.org/wiki/RDF_schema RDFs wikipedia]
-* [http://www.w3.org/2006/07/SWD/RDFa/primer/ w3c rdfa primer]
+* Check out [http://www.w3.org/TR/rdf-schema/ w3c RDF schema]
-=== RDF relation to logic ===
+Choosing the student presentations from:
+* [[Nosql links and notes]]
-Notes from lecture:
+== Lecture block 2: representing rules ==
-* [[Notes about RDF and OWL: logical meaning]]
-Understand a bit of:
-* [http://www.w3.org/TR/2003/NOTE-lbase-20031010/ Hayes & Guha Lbase]
-=== Semantics of ordinary relational base ===
+=== Lecture 5 (9. March) Student presentations on NELL and nosql databases + intro to the second lab ===
-* [http://cs.ttu.ee/kursused/wav4130/rdftutapp.pdf rdf tutorial addendum for logic and dbases]
+Student lectures on the theme of data and knowledge extraction from the web:
+* Nell and systems like Nell (are there any? Check also ConceptNet): Andrei. See some details about [http://rtw.ml.cmu.edu/rtw/ Nell] as a nice example.
+* Student presentations chosen from [[Nosql links and notes]]:
+** Rait: docs.mongodb.org/manual/  (tehtud)
+** Raigo: http://www.neo4j.org/ (tehtud)
-===  First order logic in query engines and planning ===
+Understand RDFS:
-* [[Media:Geoffreasoningnotes.pdf|Geoff reasoning course notes: just for background, no questions in exam]]
+Lecture material:
-* [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]
-* [[blocks world axiom/query examples from lecture]]
+* Continue with [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]]
-=== Data extraction ===
+Additional details (not part of exam):
-Web mining by Nell:
+* [http://en.wikipedia.org/wiki/RDF_schema RDFs wikipedia]
-* [http://rtw.ml.cmu.edu/rtw/ Nell]
+* [http://www.w3.org/TR/rdf-schema/ w3c RDF schema]
-===  Restricted english jms ===
+=== Lecture 6 (16. March) continuing RDFs and looking into other KR languages ===
-* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]
-=== Uncertain knowledge logic ===
+Lecture material:
-* [http://plato.stanford.edu/entries/logic-nonmonotonic/ nonmonotonic logic]
+* Continue with [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]]
-* [http://en.wikipedia.org/wiki/Default_logic default logic]
-* [http://sc.snu.ac.kr/courses/2008/spring/pg/krr/Lectures/Lecture11/Lec11.ppt Reasoning with Conflicting Knowledge]
-=== Indexes ===
+Additional details (not part of exam):
-Traditional database indexes incl B+ tree:
+* [http://en.wikipedia.org/wiki/RDF_schema RDFs wikipedia]
-* [http://www.lambda.ee/index.php/Pilt:IndexNotes04.ppt G. Molina lecture 4]
+* [http://www.w3.org/TR/rdf-schema/ w3c RDF schema]
-Bitmap indexes:
-* [http://en.wikipedia.org/wiki/Bitmap_index wiki]
-Hash indexes:
+Important KR languages:
-* [http://en.wikipedia.org/wiki/Hash_table wiki]
-Fulltext indexes:
+* RuleML [http://wiki.ruleml.org/index.php/RuleML_Home RuleML ]
-* [http://www.lambda.ee/index.php/Pilt:Fulltext_indexes.ppt good intro and overview]
+* OWL [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia],  [http://www.w3.org/TR/owl-guide/ w3c OWL guide]
+* KIF
+* CL [http://iso-commonlogic.org CL main page],
+* ontologies
+* wordnet
+* cyc
+* TPTP language [http://www.cs.miami.edu/~tptp/TPTP/QuickGuide/ TPTP]
+<!-- * restricted english systems [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english] -->
-Term indexes:
+=== Lecture 7 (23. March): OWL and ontologies ===
-Understand basics of discrimination tree trie-type term indexes and path indexes from
-* [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper]
-== Course structure ==
+Owl background: description logics (not part of exam )
-We start with representing and converting facts, continue to rules, first monotonic, then probabilistic and nonmonotonic, then look into search and indexing of complex information, and finally, some learning.
+* [https://www.inf.unibz.it/~franconi/dl/course/slides/prop-DL/propositional-dl.pdf description logic intro]
+* [http://disi.unitn.it/~ldkr/ml2013/slides/12.DL.ppt brief alternative intro to description logic]
+* [http://www.inf.unibz.it/~franconi/dl/course/ detailed course in description logics] (not necessary for exam)
-=== Intro and paradigms of knowledge representation ===
+Understand basics of owl:
-Lecture materials:
+* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]
-* [[Media:Kr intro.ppt | Intro lecture: declarative and procedural representations]]
-* [http://dl.dropbox.com/u/11794296/roboswarm_saso_2.pdf roboswarm example of combining dec and proc]
-For KR, declarative and procedural rep see:
+not part of exam:
-* [http://en.wikipedia.org/wiki/Knowledge_representation Short wiki overview of knowledge representation]
-* [http://groups.csail.mit.edu/medg/ftp/psz/k-rep.html Long and philosophical MIT overview of knowledge representation]
-* [http://www.cse.buffalo.edu/~rapaport/676/F01/proc.decl.html Pointers to classical papers]
-* [http://www.cogarch.org/index.php/Main_Page A Survey of Cognitive and Agent Architectures]
-* [ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/76/581/CS-TR-76-581.pdf Classical KRL paper from 1977: Bobrow & Winograd]
-Web mining by Nell:
-* [http://rtw.ml.cmu.edu/rtw/ Nell]
-* [http://www.cs.cmu.edu/~rcwang/ Richard Wang]
-* [http://www.boowa.com/ boowa extractor]
-=== Databases: meaning and representation of facts ===
+* [http://www.w3.org/TR/owl2-overview/ w3c OWL version 2 guide]
+* [http://www.w3.org/TR/owl2-primer/ w3c OWL version 2 primer]
+* [http://www.w3.org/2007/OWL/wiki/Profiles#Reasoning_in_OWL_2_RL_and_RDF_Graphs_using_Rules Owl2 wiki rule semantics]
-Lecture material:
+[[Notes about RDF and OWL: logical meaning]]
-<!-- * [[Media:Kr_plain_data_db_logic_draft.ppt|logic and databases intro draft]] -->
+Start looking at interesting ontologies:
-* [[Media:Kr_plain_data_db_logic.ppt | relation of plain data in databases to logic & representing complex structures in databases ]]
-<!-- * [[Media:Kr_prop_val_pairs.ppt|property/value pairs]] -->
-* [[Media:Kr_rdf_schemalessdb_3.pdf|key/value pairs and rdf, compared to the relational model]]
-See also about databases and logic:
+* [http://wordnet.princeton.edu/ Wordnet]
+* [http://www.cl.ut.ee/ressursid/teksaurus/ Teksaurus]
+* [http://conceptnet5.media.mit.edu/ Conceptnet]
+* [https://schema.org/docs/full.html schema.org]
+* [http://www.ontologyportal.org/ SUMO]
-* [http://www.cs.rice.edu/~tlogic/Database/all-lectures.pdf Logic and Database Queries (readable)]
+===  Lecture 8 (30 March): Restricted english ===
-* [http://magenta.ruc.dk/dat_en/research/reports/127.pdf logic in databases workshop (complex stuff)]
-See also about RDF and related:
+* [http://attempto.ifi.uzh.ch/site/pubs/ Attempto restricted english] as intro use [http://attempto.ifi.uzh.ch/site/talks/files/Talk.Stanford.05.pdf this talk]
+* [http://inform7.com/ Inform] system for interactive fiction, vt ka [http://inform-fiction.org/manual/html/contents.html vanemat raamatut]
-* [http://cs.ttu.ee/kursused/wav4130/rdftutapp.pdf rdf tutorial addendum for logic and dbases]
+Attempto details not necessary for the exam.
-* [http://en.wikipedia.org/wiki/Resource_Description_Framework RDF wikipedia]
-* [http://www.w3.org/TR/rdf-primer/ w3c RDF primer]
-* [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://tripletalk.wordpress.com/2011/01/25/rdfa-deployment-across-the-web/ rdfa and microformats deployment now]
-* [http://www.microformats.org microformats: a similar technology]
-* [http://www.w3.org/TR/2003/NOTE-lbase-20031010/ Hayes & Guha Lbase]
+== Lecture block 3: time, planning and uncertain knowledge ==
-=== Rules in logic: apps in planning, robotics, ... ===
+=== Rules in planning and robotics ===
 Lecture material:
 * [[Media:Kr_rules1.pdf|Rules and logic: refresher]] and as [[Media:Kr_rules1.ppt|ppt]]
+* [[blocks world axiom/query examples from lecture]]
-Topics:
+See also (not part of exam):
-* propositional, first order, higher order
-* semantics/models
-* proofs and deriving new information
-* automated reasoning
-See also:
 * [[Media:Geoffreasoningnotes.pdf|Geoff reasoning course notes: just for background, no questions in exam]]
 * [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]
-* [[blocks world axiom/query examples from lecture]]
-=== Various rule/logic languages ===
+=== Logic for uncertain knowledge ===
+* [http://plato.stanford.edu/entries/logic-nonmonotonic/ nonmonotonic logic] Not necessary for exam.
+* [http://en.wikipedia.org/wiki/Default_logic default logic] For exam: main material for default logic.
+<!--
+* [http://sc.snu.ac.kr/courses/2008/spring/pg/krr/Lectures/Lecture11/Lec11.ppt Reasoning with Conflicting Knowledge] Helpful additional material.
+-->
-Lecture material:
+For the exam: you should be able to create and solve small examples with default logic.
-* [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]]
-* [[Notes about RDF and OWL: logical meaning]]
-Several languages:
+=== Fuzzy and probabilistic logic ===
-* RDFS
-* OWL
-* KIF
-* CL
-* ontologies
-* wordnet
-* cyc
-* restricted english systems
-See also:
+* [[Media:Uncertain_prob_fuzzy.ppt‎|Uncertain_prob_fuzzy.ppt‎]] Intro.
-* [http://en.wikipedia.org/wiki/Resource_Description_Framework RDF wikipedia]
+* [[Media:Vienna_tanel.pdf|Vienna_tanel_2.pdf]] Additional examples and combining.
-* [http://www.w3.org/TR/rdf-primer/ w3c RDF primer]
-* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]
-* [http://www.w3.org/TR/owl-guide/ w3c OWL guide]
-* [http://cl.tamu.edu/ CL main page],
-* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]
-=== Scraping semistructured data ===
+For the exam: understand the differences between fuzzy and probabilistic logic and be able to present small examples.
-* Example for background: http://www.sightsmap.com/
+=== Logic of belief and knowledge ===
-=== Time, context, metainformation ===
+* [[Media:Ijcai93.pdf|Ijcai93.pdf]] Overview.
-=== Probabilistic and nonmonotonic reasoning ===
+For exam: understand referential transparency and core ideas about encoding belief and knowledge. Modal logic not necessary for the exam.
-See also:
+== Lecture block 4: indexes and search ==
-* [http://plato.stanford.edu/entries/logic-nonmonotonic/ nonmonotonic logic]
-* [http://en.wikipedia.org/wiki/Default_logic default logic]
-=== Personalized search and recommendations ===
+=== 27. April. Indexes: intro and mainstream ===
-=== Fast search of facts and rules using indexing ===
+Traditional database indexes incl B+ tree:
 * [http://www.lambda.ee/index.php/Pilt:IndexNotes04.ppt G. Molina lecture 4]
-* [http://www.lambda.ee/index.php/Pilt:IndexNotes05.ppt G. Molina lecture 5]
-* [http://www.lambda.ee/index.php/Pilt:Fulltext_indexes.ppt good intro and overview]
-* [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper about term indexes]
-=== Learning ===
+Hash indexes:
+* [http://en.wikipedia.org/wiki/Hash_table wiki].
+Bitmap indexes:
+* [http://en.wikipedia.org/wiki/Bitmap_index wiki].
+For exam: understand the core usage scenarios and be able to create small examples.
+=== 4. May Multi-field and geoindexes, fulltext and term indexes ===
+* A few words about both multi-field indexes and geoindexes.
+* Fulltext indexes: [http://www.lambda.ee/index.php/Pilt:Fulltext_indexes.ppt good intro and overview]
+* Term indexes: [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper]
+NB! Presentation: geoindexes, 4. May, Daniel.
+not part of exam:
+=== 4. May: Fancier term indexes ===
+* Path indexes
+* On from here.
+=== 11 May: Nosql indexes plus information about the exam ===
+* Document bases
+* Graph bases
+NB! Indexing in Graph and Document (nosql) databases. 11. May: Vassili.
+NB! Last day for the practical work presentations.
+* About the exam.
-See also:
+== 18. May: guest lecture ==
-* [http://www.cs.toronto.edu/~hinton/csc2515/notes/lec1.ppt intro]
+Kalle Tomingas. Impact analysis and ontologies.
-* [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]
+http://demo.dlineage.com
 <!--
@@ 359. rida: / 352. rida: @@
 -->
+[[teadmised_note]]
 [[Category:Kursus]]
-<!--
-<pre>
-<owl:Class rdf:ID="sugu">
-  <rdfs:subClassOf>
-    <owl:Restriction>
-      <owl:onProperty rdf:resource="sugu" />
-      <owl:allValuesFrom rdf:resource="sugu" />
-    </owl:Restriction>
-  </rdfs:subClassOf>
-</owl:Class>
-</pre>
--->

Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel

Viimane redaktsioon: 30. jaanuar 2019, kell 09:14

NB! This is an archive from 2015

Exam

Time, place, result

Focus

Practical work

First lab 2015

Second lab 2015

Third lab 2014

Lab ideas

Lecture block 1: basics and representing simple facts.

Lecture 1 (2. Feb) Overview of the course. Background and basics. First lab.

Lecture 2 (9 Feb) Programming and databases. SQL: meaning and representation of facts

Lecture 3 (16 Feb) HTML annotations. Microformats, microdata, RDFa

Lecture 4 (2. March) RDF last parts + RDFS start

Lecture block 2: representing rules

Lecture 5 (9. March) Student presentations on NELL and nosql databases + intro to the second lab

Lecture 6 (16. March) continuing RDFs and looking into other KR languages

Lecture 7 (23. March): OWL and ontologies

Lecture 8 (30 March): Restricted english

Lecture block 3: time, planning and uncertain knowledge

Rules in planning and robotics

Logic for uncertain knowledge

Fuzzy and probabilistic logic

Logic of belief and knowledge

Lecture block 4: indexes and search

27. April. Indexes: intro and mainstream

4. May Multi-field and geoindexes, fulltext and term indexes

4. May: Fancier term indexes

11 May: Nosql indexes plus information about the exam

18. May: guest lecture

Navigeerimismenüü

Otsing