Relational and Algebraic Methods in Computer Science: 12th International Conference, RAMICS 2011, Rotterdam, The Netherlands, May 30 – June 3, 2011. Proceedings

Description

This book constitutes the proceedings of the 12 International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011, held in Rotterdam, The Netherlands, in May/June 2011. This conference merges the RelMICS (Relational Methods in Computer Science) and AKA (Applications of Kleene Algebra) conferences, which have been a main forum for researchers who use the calculus of relations and similar algebraic formalisms as methodological and conceptual tools. Relational and algebraic methods and software tools turn out to be useful for solving problems in social choice and game theory. For that reason this conference included a special track on Computational Social Choice and Social Software. The 18 papers included were carefully reviewed and selected from 27 submissions. In addition the volume contains 2 invited tutorials and 5 invited talks. Front Matter....Pages - Building Structured Theories....Pages 1-21 Social Networks: Prestige, Centrality, and Influence....Pages 22-39 Synthesising Terminating Tableau Calculi for Relational Logics....Pages 40-49 From Arrow’s Impossibility to Schwartz’s Tournament Equilibrium Set....Pages 50-51 Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL....Pages 52-67 Explaining Voting Paradoxes; Including Arrow’s and Sen’s Theorems....Pages 68-69 Relation Algebraic Approaches to Fuzzy Relations....Pages 70-73 A First-Order Calculus for Allegories....Pages 74-91 Relational Modelling and Solution of Chessboard Problems....Pages 92-108 A Functional, Successor List Based Version of Warshall’s Algorithm with Applications....Pages 109-124 Variable Side Conditions and Greatest Relations in Algebraic Separation Logic....Pages 125-140 An Algebraic Approach to Preference Relations....Pages 141-147 Relational and Multirelational Representation Theorems for Complete Idempotent Left Semirings....Pages 148-163 Using Bisimulations for Optimality Problems in Model Refinement....Pages 164-179 Pathfinding through Congruences....Pages 180-195 Towards a Typed Omega Algebra....Pages 196-211 Towards an Algebra of Routing Tables....Pages 212-229 Dependently-Typed Formalisation of Relation-Algebraic Abstractions....Pages 230-247 Omega Algebras and Regular Equations....Pages 248-263 On Probabilistic Kleene Algebras, Automata and Simulations....Pages 264-279 Ampersand....Pages 280-293 Programming from Galois Connections....Pages 294-313 Constructions around Partialities....Pages 314-330 Splitting Atoms in Relational Algebras....Pages 331-346 Relational Heterogeneity Relaxed by Subtyping....Pages 347-361 Back Matter....Pages -