A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The complexity of constraint satisfaction problems for small relation algebras
2004
Artificial Intelligence
Andréka and Maddux [Notre Dame J. Formal Logic 35 (4) 1994] classified the small relation algebras-those with at most 8 elements, or in other terms, at most 3 atomic relations. They showed that there are eighteen isomorphism types of small relation algebras, all representable. For each simple, small relation algebra they computed the spectrum of the algebra, namely the set of cardinalities of square representations of that relation algebra. In this paper we analyze the computational complexity
doi:10.1016/j.artint.2004.02.003
fatcat:gnwwaharynhjxhe6iwwjco2oqe