RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






Applied Mathematics Day
September 22, 2017 17:00, Moscow, 8 Gubina
 


Ontology-based data access meets circuit complexity

V. V. Podolskii

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Video records:
MP4 957.7 Mb
MP4 262.4 Mb

Number of views:
This page:67
Video files:13

V. V. Podolskii


Видео не загружается в Ваш браузер:
  1. Установите Adobe Flash Player    

  2. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  3. Сообщите администратору портала о данной ошибке

Abstract: Ontology-based data access is an approach to organizing access to a database augmented with a logical theory. In this approach, query answering proceeds through a reformulation of a given query into a new one which can be answered without any use of theory. Thus the query answering problem reduces to the standard database setting. However, there are computational difficulties arising in this approach: size of the query may increase substantially during the reformulation. We will discuss how Boolean Circuit Complexity helps to shed a light on these problems.

Language: English

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017