Algoritmide ja andmestruktuuride erikursus: erinevus redaktsioonide vahel
Resümee puudub |
|||
| 40. rida: | 40. rida: | ||
== Brief description of the course == | == Brief description of the course == | ||
The course focuses on the internals of the methods of [https://en.wikipedia.org/wiki/Automated_reasoning automated reasoning] | The course focuses on the internals of the methods of [https://en.wikipedia.org/wiki/Automated_reasoning automated reasoning]: | ||
* Solving propositonal formulae | |||
* | |||
* SMT methods | * SMT methods | ||
* The main bulk of the course: algorithms and data structures used for | |||
The main bulk of the course | |||
full [https://en.wikipedia.org/wiki/First-order_logic first order (FOL)] reasoners. | full [https://en.wikipedia.org/wiki/First-order_logic first order (FOL)] reasoners. | ||
* The latter part will be extended to algorithms and data structures for extending standard FOL reasoners to the tasks of commonsense reasoning. | |||
The latter part will be extended to algorithms and data structures for extending standard FOL reasoners to the tasks of commonsense reasoning. | |||
<!-- | <!-- | ||
We will also use the algorithms and data structures automated reasoners for looking into the issues (in Estonian): | We will also use the algorithms and data structures automated reasoners for looking into the issues (in Estonian): | ||
Redaktsioon: 9. september 2019, kell 14:08
|
Course code: ITI8590 |
Time and place
Lectures: every Monday at 10:00-11:45 at ICT403
Practice sessions: Mondays at 14:00, but this may be changed during the first lectures in case students prefer some other suitable time.
Learning outcomes
In Estonian:
- teab mitmete erialgoritmide tööpõhimõtteid
- on suuteline rakendama neid algoritme erinevate ülesannete lahendamiseks
- teab mitmete andmestruktuuride tööpõhimõtteid ja on suuteline neid rakendama
- suudab analüüsida järjestikuste ja rekursiivsete algoritmide keerukust
Brief description of the course
The course focuses on the internals of the methods of automated reasoning:
- Solving propositonal formulae
- SMT methods
- The main bulk of the course: algorithms and data structures used for
full first order (FOL) reasoners.
- The latter part will be extended to algorithms and data structures for extending standard FOL reasoners to the tasks of commonsense reasoning.
Course materials
Will be given during the course. Materials are either presentations for specific methods or scientific papers covering such methods.
An introductory material to field is the set of course notes from Geoff Sutcliffe