Erinevus lehekülje "Teadmispõhise tarkvaraarenduse meetodid / Methods of Knowledge Based Software Development - 2015" redaktsioonide vahel

Allikas: Kursused
Mine navigeerimisribale Mine otsikasti
131. rida: 131. rida:
 
==== SMT solvers ====
 
==== SMT solvers ====
  
 +
* [https://en.wikipedia.org/wiki/Satisfiability_modulo_theories Intro to SMT from wikipedia]
 
* [https://cs.ttu.ee/staff/juhan/z3 Z3 tutorial, binaries etc] as compiled by Juhan Ernits.
 
* [https://cs.ttu.ee/staff/juhan/z3 Z3 tutorial, binaries etc] as compiled by Juhan Ernits.
  

Redaktsioon: 9. november 2015, kell 15:53


Course code: ITI8600 (Ainekaart eesti keeles ITI8600)

Language: The default language of the course is English, but if all students understand Estonian, it will be in Estonian

Lecturers:

  • Tanel Tammet, tanel.tammet@ttu.ee, 6203457, TTÜ ICT-426
  • Juhan Ernits, juhan.ernits@ttu.ee, 6202326, TTÜ ICT-428 (handles ÕIS registrations)

Past editions

This course will be offered for the first time in 2015. It is the result of combining three previously offered courses, Knowledge Search, Formalization and Storing, Principles of Artificial Intelligence and applied logic

Time, place, result

  • Lectures: Mondays 17:45-19:15, SOC-211B, SOC-211C
  • Labs: Tuesdays 17:45-19:15, ICT-401

Grading

The final grade will be based on 40% of points from homework assignments and 60% of the result of an exam.

There will be four homework assignments, one for each block. Assignments will give up to 10 points each. In order to successfully pass the course, at least three homeworks must be successfully defended.

Homeworks can be done alone or in pairs. Pairs will be formed randomly by the lecturers, separately for each homework. As said, you can always opt to do it alone.

Homework has to be presented during lab time to the lecturer on site: email submissions are not accepted. Both pair members must be present during presentation: in case one of them is not present, the homework of the missing person is not considered to be defended. It is also not guaranteed that both pair members get the same grade.

The homeworks have to be submitted to the university git and then defended: git details will be presented later by Juhan.

Homework deadline policy:

  • Defended code must be submitted for defence latest one date before the defence deadline (example: defence deadline 22. Sept, submission 21. Sept).
  • In case the homework is defended in time, you have one extra week to add missing details/improvements without losing points.
  • In case the homework is not defended in time, you have two extra weeks to defend it, but in this case you will get only half the points.
  • No homeworks are accepted after the two extra weeks after the deadline have passed.
  • In order to be accepted to exam you have to successfully defend at least three of the four homeworks.

Grades and additional homework info available at https://ained.ttu.ee

Course structure

The course will consist of four interconnected blocks covering crucial areas of the subject:

Search algorithms

Homework is available in Moodle. To log in you will need to use your TUT e-mail account in Office 365. The groups have been assigned to participants who registered to the course in Moodle on September 14. Homework defence deadline: 22. September.

NB! Konsultatsioon / Q&A session 1: September 17, 17.00-19.00 in room ICT-411. If the room is empty, please call 2326 from the door phone of the department of CS.

Knowledge representation

Knowledge representation homework

Homework defence deadline: 3. November. Presentation afer this deadline will give half of the points. Absolute deadline end of November.

Work should be submitted to git. Latest one day before deadline.

New groups and repositories are available.

Useful in-depth material for reading as free pdf-s:

Block structure:

Intro: SQL, logic and RDF.

First lecture as ppt and as as pdf

Natural language and restricted natural language

Useful NLP links and notes

Lecture intro as ppt and as as pdf

See also about IBM Watson

RDFa, RDFs, OWL and rules

Lecture intro as ppt and as as pdf

Context, metainformation and rules.

Reasoning and deduction

Automated reasoning homework 2015


Homework defence deadline: 24. November.

Useful books for reading:


Test and compare simple propositional solver algorithms:

Block structure:

First order logic solvers

Propositional solvers

SMT solvers

Logic for uncertain knowledge

Learning

Homework defence deadline: 15. December.

Pärit leheküljelt "http://courses.cs.taltech.ee/w/index.php?title=Teadmispõhise_tarkvaraarenduse_meetodid_/_Methods_of_Knowledge_Based_Software_Development_-_2015&oldid=3332"