Teadmiste otsing, formaliseerimine ja hoidmine
 |
Code: ITV0060 |
Time, place, result
Semester: spring
Grading: exam
Lectures: every Wedesday 16:00-17.30, room ICT-A2
Practical work: Fridays on odd weeks (7. Feb, 21 Feb, ...) 12:00-13:30 room ICT-403
Practical work will give 40% and exam 60% of points underlying the final grade.
Practical work
There are three labs. All labs have to be presented to the prof and all students present at labwork.
First lab 2014
Second lab 2014
Third lab 2014
Lectures
Declarative and procedural representations
Lecture materials:
- Intro lecture: declarative and procedural representations
- relation of plain data in databases to logic & representing complex structures in databases
Databases: meaning and representation of facts
Lecture materials:
NoSQL databases
Not for exam.
HTML annotations. RDFa, reading and using RDF data from web pages. Starting RDFs
For exam: no xml syntax necessary. Syntax unimportant, except for RDFa.
Lecture materials:
- RDFa and RDFs: Media:Kr_annot_rdfa_rdfs.ppt or as Media:kr_annot_rdfa_rdfs.pdf
Understand main parts:
- wiki intro
- Media:portaalidekoosvoime.ppt or as pdf Media:portaalidekoosvoime.pdf (for exam: just an example for the material above and below)
- [http://www.w3.org/TR/xhtml-rdfa-primer/ w3c rdfa primer (for exam: understand the basics, not all details)
RDFs and owl OWL
- Notes about RDF and OWL: logical meaning (for exam: you should understand this!)
Understand RDFS:
(for exam: you should understand the core principles of rdfs)
Lecture material:
- RDFs wikipedia
- RDFS: rdf schema and as ppt
- Notes about RDF and OWL: logical meaning
- w3c RDF primer see chapter "5. Defining RDF Vocabularies: RDF Schema"
Understand basics of owl:
(for exam: you should understand the core principles of owl, not the details below here)
Owl background: description logics
- detailed course in description logics (not necessary for exam)
Start looking at interesting ontologies:
- SUMO (not necessary for exam)
Rules in logic: apps in planning, robotics, ...
For exam: you should be able to encode a small blocks world planning example and solve it. The details below "see also" are not necessary, but the last example is useful.
Lecture material:
- Rules and logic: refresher and as ppt
See also:
- Geoff reasoning course notes: just for background, no questions in exam
- planning and blocks world
- blocks world axiom/query examples from lecture
Logic for uncertain knowledge
For the exam: you should be able to create and solve small examples with default logic.
- nonmonotonic logic Not necessary for exam.
- default logic For exam: main material for default logic.
- Reasoning with Conflicting Knowledge Helpful additional material.
Fuzzy and probabilistic logic
For the exam: understand the differences between fuzzy and probabilistic logic and be able to present small examples.
- Uncertain_prob_fuzzy.ppt Intro.
- Vienna_tanel_2.pdf Additional examples and combining.
Logic of belief and knowledge
For the exam: understand referential transparency and core ideas about encoding belief and knowledge. Modal logic not necessary for the exam.
- Ijcai93.pdf Overview.
Indexes
You should be able to understand where to use what and solve small examples. Algorithms for updating B+ trees not necessary for exam.
Traditional database indexes incl B+ tree:
Bitmap indexes:
- wiki. For exam: understand the core usage scenario of bitmap indexes.
Hash indexes:
- wiki. Understand the core usage scenario and be able to create a small example.
Data extraction
Not necessary for the exam.
Web mining by Nell:
Restricted english
Not necessary for the exam.
Various rule/logic languages
Not necessary for the exam.
Several languages:
- RDFS
- OWL
- KIF
- CL
- ontologies
- wordnet
- cyc
- restricted english systems
See also: