Computational complexity for bounded distributive lattices with negation

被引：1
|
作者：
Shkatov, Dmitry [1 ]
Van Alten, C. J. [1 ]
机构：
[1] Univ Witwatersrand, Sch Comp Sci & Appl Math, Private Bag 3, ZA-2050 Johannesburg, South Africa
来源：
ANNALS OF PURE AND APPLIED LOGIC | 2021年 / 172卷 / 07期
关键词：
Universal theory; Computational complexity; Distributive lattice with negation; Partial algebra;
D O I：
10.1016/j.apal.2021.102962
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal logic. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数：29
相关论文
共 50 条
12345