Cantitate/Preț
Produs

Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Germany, May 12-17, 2003, Revised Selected Papers: Lecture Notes in Computer Science, cartea 3051

Editat de R. Berghammer, Bernhard Möller, Georg Struth
en Limba Engleză Paperback – iun 2004

Din seria Lecture Notes in Computer Science

Preț: 36927 lei

Nou

Puncte Express: 554

Preț estimativ în valută:
7070 7660$ 5904£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540221456
ISBN-10: 354022145X
Pagini: 296
Ilustrații: X, 286 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Papers.- Choice Procedures in Pairwise Comparison Multiple-Attribute Decision Making Methods.- Kleene Algebra with Relations.- Contributed Papers.- Integrating Model Checking and Theorem Proving for Relational Reasoning.- Fixed-Point Characterisation of Winning Strategies in Impartial Games.- Checking the Shape Safety of Pointer Manipulations.- Applying Relational Algebra in 3D Graphical Software Design.- Investigating Discrete Controllability with Kleene Algebra.- Tracing Relations Probabilistically.- Pointer Kleene Algebra.- Kleene Modules.- The Categories of Kleene Algebras, Action Algebras and Action Lattices Are Related by Adjunctions.- Towards a Formalisation of Relational Database Theory in Constructive Type Theory.- SCAN Is Complete for All Sahlqvist Formulae.- Relations and GUHA-Style Data Mining II.- A Note on Complex Algebras of Semigroups.- Calculational Relation-Algebraic Proofs in Isabelle/Isar.- A Calculus of Typed Relations.- Greedy-Like Algorithms in Modal Kleene Algebra.- Rasiowa-Sikorski Style Relational Elementary Set Theory.- Relational Data Analysis.- Two Proof Systems for Peirce Algebras.- An Institution Isomorphism for Planar Graph Colouring.- Decomposing Relations into Orderings.