The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski, and a class of examples over a fixed finite algebra on which all iterative local algorithms, whether parallel or sequential, must take quadratic time is given.Expand

Three varieties of algebras are introduced which extend the variety RA of relation algebras. They are obtained from RA by weakening the associative law for relative product, and are consequently… Expand

The main tools are a construction of nonrepresentable one-generated relationAlgebras, a method for obtaining cylindric algebrAs from relation algeBRas, and the use of relation alGEbras in defining algebraic semantics for first-order logic.Expand

This work forms networks and algorithms in a general algebraic setting, that of Tarski’s relation algebra, and obtains a parallel O(n logn) upper bound for path-consistency, and considers BCNs over various classes of relations that arise from an underlying linearly ordered set.Expand

For every finite cardinal α ≥ 3 there is a logically valid sentence X, in a first-order language ℒ with equality and exactly one nonlogical binary relation symbol E, such that X contains only 3 variables, and X has a proof containing exactly α + 1 variables, but X has no proof containing only α variables.Expand

There is no algorithm for determining whether or not an equation is true in every 3-dimensional cylindric algebra. This theorem completes the solution to the problem of finding those values of a and… Expand