Sergei Obiedkov

20 papers B 1C 3Journal 9Unranked 7
YearRankTypeTitle / Venue / Authors
2025 — conf
PAC Learning of Concept Inclusions for Ontology- Mediated Query Answering (Extended Abstract).
DL
Sergei Obiedkov, Baris Sertkaya
2025 J jnl
PAC learning of concept inclusions for ontology-mediated query answering.
Int. J. Approx. Reason.
Sergei Obiedkov, Baris Sertkaya
2025 — conf
Rational Inference in Formal Concept Analysis.
CONCEPTS
Lucas Carr, Nicholas Leisegang, Thomas Andreas Meyer, Sergei Obiedkov
2025 J jnl
Rational Inference in Formal Concept Analysis.
CoRR
Lucas Carr, Nicholas Leisegang, Thomas Meyer, Sergei Obiedkov
2025 — conf
When Horn is All You Need.
CONCEPTS
Sergei Obiedkov, Sebastian Rudolph
2024 — conf
Collaborative Hybrid Human AI Learning through Conceptual Exploration.
HHAI Workshops
Bernhard Ganter, Tom Hanika, Johannes Hirth, Sergei Obiedkov
2024 — conf
Probably Approximately Correct Ontology Completion with pacco (Extended Abstract).
Description Logics
Sergei Obiedkov, Baris Sertkaya
2024 — conf
Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian.
LREC/COLING
Daniil Kosakin, Sergei Obiedkov, Ivan Smirnov, Ekaterina V. Rakhilina, Anastasia Vyrenkova, Ekaterina Zalivina
2024 J jnl
Selected papers from the First International Joint Conference on Conceptual Knowledge Structures.
Int. J. Approx. Reason.
Inma P. Cabrera, Sébastien Ferré, Sergei Obiedkov
2023 J jnl
A Language Model for Grammatical Error Correction in L2 Russian.
CoRR
Nikita Remnev, Sergei Obiedkov, Ekaterina V. Rakhilina, Ivan Smirnov, Anastasia Vyrenkova
2023 B conf
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis.
JELIA
Sergei Obiedkov, Baris Sertkaya
2021 C conf
Approximate Computation of Exact Association Rules.
ICFCA
Saurabh Bansal, Sriram Kailasam, Sergei Obiedkov
2020 J jnl
From equivalence queries to PAC learning: The case of implication theories.
Int. J. Approx. Reason.
Ramil Yarullin, Sergei Obiedkov
2020 J jnl
Probably approximately correct learning of Horn envelopes from queries.
Discret. Appl. Math.
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2019 C conf
Learning Implications from Data and from Queries.
ICFCA
Sergei Obiedkov
2019 — conf
Probably Approximately Correct Completion of Description Logic Knowledge Bases.
Description Logics
Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin
2018 J jnl
Probably approximately correct learning of Horn envelopes from queries.
CoRR
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2017 C conf
On the Usability of Probably Approximately Correct Implication Bases.
ICFCA
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2017 J jnl
On the Usability of Probably Approximately Correct Implication Bases.
CoRR
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2017 J jnl
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics.
Theor. Comput. Sci.
Sergei Obiedkov