Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. - Sergei O. Kuznetsov; Sergei A. Obiedkov (PKDD, 2001)

Modal Logic for Evaluating Formulas in Incomplete Contexts. - Sergei A. Obiedkov (ICCS, 2002)

Comparing performance of algorithms for generating concept lattices. - Sergei O. Kuznetsov; Sergei A. Obiedkov (J. Exp. Theor. Artif. Intell., 2002)

Implications in Triadic Formal Contexts. - Bernhard Ganter; Sergei A. Obiedkov (ICCS, 2004)

AddIntent: A New Incremental Algorithm for Constructing Concept Lattices. - Dean van der Merwe; Sergei A. Obiedkov; Derrick G. Kourie (ICFCA, 2004)

Towards Concise Representation for Taxonomies of Epistemic Communities. - Camille Roth; Sergei A. Obiedkov; Derrick G. Kourie (CLA, 2006)

On Lattices in Access Control Models. - Sergei A. Obiedkov; Derrick G. Kourie; Jan H. P. Eloff (ICCS, 2006)

Counting Pseudo-intents and #P-completeness. - Sergei O. Kuznetsov; Sergei A. Obiedkov (ICFCA, 2006)

TABASCO: using concept-based taxonomies in domain engineering. - Loek G. Cleophas; Bruce W. Watson; Derrick G. Kourie; Andrew Boake; Sergei A. Obiedkov (South Afr. Comput. J., 2006)

Reducing the Representation Complexity of Lattice-Based Taxonomies. - Sergei O. Kuznetsov; Sergei A. Obiedkov; Camille Roth (ICCS, 2007)

Attribute-incremental construction of the canonical implication basis. - Sergei A. Obiedkov; Vincent Duquenne (Ann. Math. Artif. Intell., 2007)

Some decision and counting problems of the Duquenne-Guigues basis of implications. - Sergei O. Kuznetsov; Sergei A. Obiedkov (Discret. Appl. Math., 2008)

On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis. - Camille Roth; Sergei A. Obiedkov; Derrick G. Kourie (Int. J. Found. Comput. Sci., 2008)

Building access control models with attribute exploration. - Sergei A. Obiedkov; Derrick G. Kourie; Jan H. P. Eloff (Comput. Secur., 2009)

An incremental algorithm to construct a lattice of set intersections. - Derrick G. Kourie; Sergei A. Obiedkov; Bruce W. Watson; Dean van der Merwe (Sci. Comput. Program., 2009)

Approaches to the Selection of Relevant Concepts in the Case of Noisy Data. - Mikhail Klimushkin; Sergei A. Obiedkov; Camille Roth (ICFCA, 2010)

Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis. - Konstantin Bazhanov; Sergei A. Obiedkov (CLA, 2011)

Modeling Preferences over Attribute Sets in Formal Concept Analysis. - Sergei A. Obiedkov (ICFCA, 2012)

Preface. - Marzena Kryszkiewicz; Sergei A. Obiedkov; Zbigniew W. Ras (Fundam. Informaticae, 2012)

Modeling Ceteris Paribus Preferences in Formal Concept Analysis. - Sergei A. Obiedkov (ICFCA, 2013)

Optimizations in computing the Duquenne-Guigues basis of implications. - Konstantin Bazhanov; Sergei A. Obiedkov (Ann. Math. Artif. Intell., 2014)

Large-Scale Parallel Matching of Social Network Profiles. - Alexander Panchenko; Dmitry Babaev; Sergei A. Obiedkov (AIST, 2015)

Conceptual Exploration - Bernhard Ganter; Sergei A. Obiedkov (Springer, 2016)

On the Usability of Probably Approximately Correct Implication Bases. - Daniel Borchmann; Tom Hanika; Sergei Obiedkov (ICFCA, 2017)

Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics. - Sergei Obiedkov (Theor. Comput. Sci., 2017)

Neologisms on Facebook. - Nikita Muravyev; Alexander Panchenko; Sergei A. Obiedkov (CoRR, 2018)

Probably Approximately Correct Completion of Description Logic Knowledge Bases. - Sergei Obiedkov; Baris Sertkaya; Denis Zolotukhin (Description Logics, 2019)

Learning Implications from Data and from Queries. - Sergei Obiedkov (ICFCA, 2019)

Probably approximately correct learning of Horn envelopes from queries. - Daniel Borchmann; Tom Hanika; Sergei Obiedkov (Discret. Appl. Math., 2020)

From equivalence queries to PAC learning: The case of implication theories. - Ramil Yarullin; Sergei Obiedkov (Int. J. Approx. Reason., 2020)

Approximate Computation of Exact Association Rules. - Saurabh Bansal; Sriram Kailasam; Sergei Obiedkov (ICFCA, 2021)

Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. - Sergei Obiedkov; Baris Sertkaya (JELIA, 2023)

A Language Model for Grammatical Error Correction in L2 Russian. - Nikita Remnev; Sergei Obiedkov; Ekaterina V. Rakhilina; Ivan Smirnov; Anastasia Vyrenkova (CoRR, 2023)

Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian. - Daniil Kosakin; Sergei Obiedkov; Ivan Smirnov; Ekaterina V. Rakhilina; Anastasia Vyrenkova; Ekaterina Zalivina (LREC/COLING, 2024)

Probably Approximately Correct Ontology Completion with pacco (Extended Abstract). - Sergei Obiedkov; Baris Sertkaya (Description Logics, 2024)

Collaborative Hybrid Human AI Learning through Conceptual Exploration. - Bernhard Ganter; Tom Hanika; Johannes Hirth; Sergei Obiedkov (HHAI Workshops, 2024)

Selected papers from the First International Joint Conference on Conceptual Knowledge Structures. - Inma P. Cabrera; Sébastien Ferré; Sergei Obiedkov (Int. J. Approx. Reason., 2024)

PAC learning of concept inclusions for ontology-mediated query answering. - Sergei Obiedkov; Baris Sertkaya (Int. J. Approx. Reason., 2025)

Rational Inference in Formal Concept Analysis. - Lucas Carr; Nicholas Leisegang; Thomas Meyer; Sergei Obiedkov (CoRR, 2025)