TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS
2010 ◽
Vol 20
(08)
◽
pp. 1001-1020
◽
Keyword(s):
We study the computational complexity of the satisfiability problem of an equation between terms over a finite algebra (TERM-SAT). We describe many classes of algebras where the complexity of TERM-SAT is determined by the clone of term operations. We classify the complexity for algebras generating maximal clones. Using this classification we describe many of algebras where TERM-SAT is NP-complete. We classify the situation for clones which are generated by an order or a permutation relation. We introduce the concept of semiaffine algebras and show polynomial-time algorithms which solve the satisfiability problem for them.
2006 ◽
Vol 16
(03)
◽
pp. 563-581
◽
2000 ◽
Vol 11
(01)
◽
pp. 29-63
2016 ◽
Vol 41
(3)
◽
pp. 163-181
Keyword(s):
2015 ◽
Vol 25
(04)
◽
pp. 283-298
Keyword(s):
2008 ◽
Vol 15
(02)
◽
pp. 173-187
◽
Keyword(s):
2020 ◽
Vol 40
(4)
◽
pp. 1008-1019
1991 ◽
Vol 02
(02)
◽
pp. 83-99
Keyword(s):