Liebe Besucherinnen und Besucher,
heute ab 15 Uhr feiern wir unser Sommerfest und sind daher nicht erreichbar. Ab morgen sind wir wieder wie gewohnt für Sie da. Wir bitten um Ihr Verständnis – Ihr Team von Sack Fachmedien
E-Book, Englisch, Band 3051, 286 Seiten, eBook
Berghammer / Möller / Struth Relational and Kleene-Algebraic Methods in Computer Science
Erscheinungsjahr 2004
ISBN: 978-3-540-24771-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
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
E-Book, Englisch, Band 3051, 286 Seiten, eBook
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-24771-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.