Sergei Obiedkov

Probably Approximately Correct Completion of Description Logic Knowledge Bases

Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin, 2019, Description Logics.

On the Usability of Probably Approximately Correct Implication Bases

Tom Hanika, Sergei Obiedkov, Daniel Borchmann, 2017, ICFCA.

Learning Implications from Data and from Queries

Sergei Obiedkov, S. Obiedkov, 2019, ICFCA.

From equivalence queries to PAC learning: The case of implication theories

Ramil Yarullin, Sergei Obiedkov, 2020, Int. J. Approx. Reason..

Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics

Sergei Obiedkov, 2017, Theor. Comput. Sci..

Probably approximately correct learning of Horn envelopes from queries pdf

Tom Hanika, Sergei Obiedkov, Daniel Borchmann, 2018, Discret. Appl. Math..