( en | de | ru )

 

Disambiguation of "Obiedkov, Sergei"

Author of the publication

copydeleteadd this publication to your clipboard
On the Usability of Probably Approximately Correct Implication Bases.

, , and . ICFCA, volume 10308 of Lecture Notes in Computer Science, page 72-88. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sergei Traustel

Sergei Traustel

Sergei Sawitzki

Sergei Adichtchev

Sergei Mariev

 

Other publications of authors with the same name

Learning Implications from Data and from Queries.. ICFCA, volume 11511 of Lecture Notes in Computer Science, page 32-44. Springer, (2019)Probably Approximately Correct Completion of Description Logic Knowledge Bases., , and . Description Logics, volume 2373 of CEUR Workshop Proceedings, CEUR-WS.org, (2019)Filtering lattice-based taxonomies with concept stability: A case study in the analysis of political texts, , , and . (2010)Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics.. Theor. Comput. Sci., (2017)Towards concise representation for taxonomies of epistemic communities, , and . Concept lattices and their applications, Springer, (2008)A Language Model for Grammatical Error Correction in L2 Russian., , , , and . CoRR, (2023)Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian., , , , , and . LREC/COLING, page 14240-14258. ELRA and ICCL, (2024)ConExp - The Concept Explorer, , , , , and . (2000-2006)Approximate Computation of Exact Association Rules., , and . ICFCA, volume 12733 of Lecture Notes in Computer Science, page 107-122. Springer, (2021)From equivalence queries to PAC learning: The case of implication theories., and . Int. J. Approx. Reason., (2020)