found: Work cat.: Relational and Kleene-algebraic methods in computer science, c2004:p. 8 (Kleene algebra (KA))
found: Wikipedia, Dec. 2, 2009(Kleene algebra (named after Stephen Cole Kleene) is either of two different things: A bounded distributive lattice with an involution satisfying De Morgan's laws, and the inequality. Thus every Boolean algebra is a Kleene algebra, but most Kleene algebras are not Boolean algebras. Just as Boolean algebras are related to the classical propositional logic, Kleene algebras relate to Kleene's three-valued logic)
found: Schloss Dagstuhl website, Dec. 2, 2009(Kleene algebra is an algebraic system for calculating with sequential composition, choice and finite iteration. Although its theory has a long history, going back to Kleene (1956) and Conway (1971), and the connections with classical relational algebra and formal language theory are well established, new theoretical connections but also more practical applications are constantly being discovered.)