Relational methods can be found at various places in computer science, notably in data base theory, relational semantics on concurrency, relational type theory, analysis of rewriting systems, and modern programming language design. In addition, they appear in algorithms analysis and in the bulk of discrete mathematics taught to computer scientists. This book is devoted to the background of these methods. It is the first to explain how to use relational and graph-theoretic methods systematically in computer science. A formal framework of relational algebra is developed with respect to applications to a diverse range of problem areas. Results are first motivated by practical examples, often visualized by both Boolean O-1 matrices and graphs, and then derived algebraically.
"synopsis" may belong to another edition of this title.
£ 13.33 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: New. *Price HAS BEEN REDUCED by 10% until Monday, Sept. 1 (holiday Sale Item)* 301 pp., hardcover, NEW!! - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1299232
Quantity: 1 available