Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel
| 59. rida: | 59. rida: | ||
lab. The ruleset has to be encoded in a format suitable for some first-order based logical prover and then used | lab. The ruleset has to be encoded in a format suitable for some first-order based logical prover and then used | ||
with the prover to actually derive new facts. | with the prover to actually derive new facts. | ||
--> | |||
<!-- | |||
--> | --> | ||
Redaktsioon: 1. veebruar 2014, kell 22:41
![]() |
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.
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.
The course contains three blocks built on each other:
- Declarative and procedural representations, relational and nosql databases, core logic, html annotations.
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
Lecture block 1: declarative/procedural, KR in programming languages, databases, core logic, web annotations
Declarative and procedural representations. Notes on relational databases.
Lecture materials:
- Intro lecture: declarative and procedural representations
- relation of plain data in databases to logic & representing complex structures in databases
Databases: SQL and NoSQL: meaning and representation of facts
Lecture materials:
HTML annotations. Microformats, microdata, RDFa, Starting RDFs
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)
Data extraction
- Overview
- Some details about Nell as a nice example.
Lecture block 2: various languages: rule/logic languages, restricted English
Important rule/logic languages
Not necessary for the exam.
Several languages:
- RDFS
- OWL
- KIF
- CL
- ontologies
- wordnet
- cyc
- restricted english systems
See also:
RDFs and OWL
Understand 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:
Owl background: description logics
- detailed course in description logics (not necessary for exam)
Start looking at interesting ontologies:
Restricted english
Attempto details not necessary for the exam.
Lecture block 3: time and uncertain knowledge
Rules in planning and robotics
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
- nonmonotonic logic Not necessary for exam.
- default logic For exam: main material for default logic.
- Reasoning with Conflicting Knowledge Helpful additional material.
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
Indexes: intro and mainstream
Traditional database indexes incl B+ tree:
Hash indexes:
- wiki.
Bitmap indexes:
- wiki.
For exam: understand the core usage scenarios and be able to create small examples.
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
Fancier term indexes
- Path indexes
- On from here.
Nosql indexes
- Document bases
- Graph bases
