( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Usability of Probably Approximately Correct Implication Bases.

, , и . ICFCA, том 10308 из Lecture Notes in Computer Science, стр. 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.

Sergei Traustel

Sergei Traustel

Sergei Sawitzki

Sergei Adichtchev

Sergei Shapiro

 

Другие публикации лиц с тем же именем

Probably Approximately Correct Completion of Description Logic Knowledge Bases., , и . Description Logics, том 2373 из CEUR Workshop Proceedings, CEUR-WS.org, (2019)Learning Implications from Data and from Queries.. ICFCA, том 11511 из Lecture Notes in Computer Science, стр. 32-44. Springer, (2019)Towards concise representation for taxonomies of epistemic communities, , и . Concept lattices and their applications, Springer, (2008)Filtering lattice-based taxonomies with concept stability: A case study in the analysis of political texts, , , и . (2010)Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics.. Theor. Comput. Sci., (2017)A Language Model for Grammatical Error Correction in L2 Russian., , , , и . CoRR, (2023)ConExp - The Concept Explorer, , , , , и . (2000-2006)Approximate Computation of Exact Association Rules., , и . ICFCA, том 12733 из Lecture Notes in Computer Science, стр. 107-122. Springer, (2021)From equivalence queries to PAC learning: The case of implication theories., и . Int. J. Approx. Reason., (2020)Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis., и . JELIA, том 14281 из Lecture Notes in Computer Science, стр. 176-191. Springer, (2023)