Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel

Allikas: Lambda
Mine navigeerimisribale Mine otsikasti
Resümee puudub
85. rida: 85. rida:


=== Logic ===
=== Logic ===
2 lectures


* propositional, first order, higher order
* propositional, first order, higher order
95. rida: 93. rida:
=== Planning  ===
=== Planning  ===


1 lecture
With logic and reasoning-based methods.
 
logic- and reasoning-based methods
 


=== Specific versions of 1st order logic and rule systems ===
=== Specific versions of 1st order logic and rule systems ===
109. rida: 104. rida:
* restricted english systems
* restricted english systems


=== RDFS and OWL ===


=== Additional details of RDF and RDFS ===
=== Probabilistic and default reasoning ===
 


=== OWL ===
=== Practical reasoning with procedural attachments: robot example ===


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


=== Representing time, probability, epistemics, context ===
=== Personalized suggestions with probabilistic rules ===
 


=== Search and indexing ===
=== Search and indexing ===


=== Learning ===
=== Learning ===

Redaktsioon: 9. veebruar 2010, kell 01:07

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: tammet@staff.ttu.ee, 6203457, TTÜ AK223
Archives of previous years: 2009, 2008, 2007, 2006, [http:/cs.ttu.ee/kursused/wav4130/ older].

Time, place, result

Semester: spring
Grading: exam
Points: 3.5

Lectures: every Monday 15.00-16.30, room IT-137a
Practical work: every Monday after the lecture: 16.45-17.30

Practical work will give 40% and exam 60% of points underlying the final grade. There will be an optional (hard) third practical work: choosing this will give 60% from labs and 40% from exam.

Practical work

  • two labs on the same theme.
  • optional third lab


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

NB! You may not use a ready-made RDFa parser/converter. Instead, use a html/xml parser and build the RDFa converter on top of that. Using xslt is also an OK option. Programming language and the html/xml parser choice is free.

You will have to find suitable annotated html pages to demonstrate your solution.

Additional reading:

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.

Here you can see the details from 2009: Details of the second lab: rule system. The 2010 lab will be somewhat different. Details will be presented in March.

Third lab

Will appear in April.

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

Different property/value pair representations

Introduction to RDFa

1 lecture

Relational databases, logic and RDF

1 lecture

Logic

  • propositional, first order, higher order
  • semantics/models
  • proofs and deriving new information
  • automated reasoning

Planning

With logic and reasoning-based methods.

Specific versions of 1st order logic and rule systems

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

RDFS and OWL

Probabilistic and default reasoning

Practical reasoning with procedural attachments: robot example

Representing time, epistemics, context

Personalized suggestions with probabilistic rules

Search and indexing

Learning