基本信息
浏览量:59
职业迁徙
个人简介
He considered the closure operator for predicates (or relations) and proposed a new technique for operating with predicates. Using this technique he obtained the following results. Dmitriy completely described the lattice of all clones of self-dual functions in three-valued logic. Thus, the class of all self-dual functions is the first maximal (or precomplete) class in three-valued logic except the class of all linear function that has such description. For every minimal clone in three-valued logic he found the cardinality of the set of all clones containing this minimal clone. He also proved that the following problem is decidable: given a finite relational structure S, decide whether S admits a near-unanimity function. This problem appeared in studying of Constraint Satisfaction Problem and was an open problem for many years.
研究兴趣
论文共 45 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
SODA (2023): 2746-2760
arxiv(2023)
LOGICAL METHODS IN COMPUTER SCIENCEno. 3 (2022)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn