Sergei Obiedkov

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 13

Top Topics

Error Correction

Argumentation Frameworks

Top Venues

Description Logics

Int. J. Approx. Reason.

Publications

Daniil Kosakin, Sergei Obiedkov, Ivan Smirnov, Ekaterina V. Rakhilina, Anastasia Vyrenkova, Ekaterina Zalivina
Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian. LREC/COLING (2024)
Sergei Obiedkov, Baris Sertkaya
Probably Approximately Correct Ontology Completion with pacco (Extended Abstract). Description Logics (2024)
Nikita Remnev, Sergei Obiedkov, Ekaterina V. Rakhilina, Ivan Smirnov, Anastasia Vyrenkova
A Language Model for Grammatical Error Correction in L2 Russian. CoRR (2023)
Sergei Obiedkov, Baris Sertkaya
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. JELIA (2023)
Saurabh Bansal, Sriram Kailasam, Sergei Obiedkov
Approximate Computation of Exact Association Rules. ICFCA (2021)
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
Probably approximately correct learning of Horn envelopes from queries. Discret. Appl. Math. 273 (2020)
Ramil Yarullin, Sergei Obiedkov
From equivalence queries to PAC learning: The case of implication theories. Int. J. Approx. Reason. 127 (2020)
Sergei Obiedkov
Learning Implications from Data and from Queries. ICFCA (2019)
Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin
Probably Approximately Correct Completion of Description Logic Knowledge Bases. Description Logics (2019)
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
Probably approximately correct learning of Horn envelopes from queries. CoRR (2018)
Sergei Obiedkov
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics. Theor. Comput. Sci. 658 (2017)
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
On the Usability of Probably Approximately Correct Implication Bases. CoRR (2017)
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
On the Usability of Probably Approximately Correct Implication Bases. ICFCA (2017)