, Pair-dense relation algebras, Transactions of the American Mathematical Society (to appear). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Some Algebras And Algorithms For Reasoning About Time And Space - Maddux (1990) (1 citation) Self-citation (Algebras) (Correct)
....are not satisfiable ( A83] Ma89] The hypothesis that A is finite cannot be omitted. There are some infinite representable relation algebras for which Theorem 5 is false ( Ly50] Ma78] Closed atomic networks are used for various other algebraic purposes in [Ma78] Ma82] Ma85] Ma89] and [Ma89a]. The closure of a network is a reduction which can be found in polynomial time. Finding an atomic reduction can be NP hard for some relation algebras. Sometimes atomic networks are always satisfiable, so the problem of determining constraint satisfiability reduces to finding an atomic reduction. ....
, Pair-dense relation algebras, Transactions of the American Mathematical Society (to appear).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC