Relational and Algebraic Methods in Computer Science
Total Page:16
File Type:pdf, Size:1020Kb
Lecture Notes in Computer Science 6663 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany Harrie de Swart (Ed.) Relational and Algebraic Methods in Computer Science 12th International Conference, RAMICS 2011 Rotterdam, The Netherlands, May 30 – June 3, 2011 Proceedings 13 Volume Editor Harrie de Swart Erasmus University Rotterdam Faculty of Philosophy P.O. Box 1738, 3000 DR Rotterdam, The Netherlands E-mail: [email protected] ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-21069-3 e-ISBN 978-3-642-21070-9 DOI 10.1007/978-3-642-21070-9 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: Applied for CR Subject Classification (1998): F.4, I.1, I.2.3, D.2.4, D.3.4 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues © Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Preface This volume contains the proceedings of the 12th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2011) with a special track on Computational Social Choice and Social Software. The confer- ence took place in Rotterdam, The Netherlands, from May 30 to June 3, 2011. Over the past 20 years, the RelMiCS (Relational Methods in Computer Science) and AKA (Applications of Kleene Algebra) conferences have been a main forum for researchers who use the calculus of relations and similar algebraic formalisms as methodological and conceptual tools. At the last of these conferences it was decided that the two series should be united under the new title “Relational and Algebraic Methods in Computer Science” (RAMiCS). This year, special attention was paid to the fact that the meetings started 20 years ago at the Ba- nach Center in Warsaw. It was commemorated with an invited lecture by Chris Brink, who, together with Ewa Orlowska and Gunther Schmidt, was one of the originators of this series. Relational and algebraic methods and software tools like RelView 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, organized by the CFSC (Computational Foundations of Social Choice) and SSEAC (Social Software for Elections, the Allocation of tenders and Coalition formation) projects of the ESF LogiCCC programme. Each submission was reviewed by three Programme Committee members. The committee decided to accept 18 papers. The programme also included five invited talks, of which three were on relational and algebraic methods, by Chris Brink, Bernhard M¨oller (included) and Renate Schmidt (included), and two on social choice theory, by Donald Saari and Agnieszka Rusinowska (included). In addition, there were two tutorials on relational and algebraic methods, by Georg Struth (included) and Michael Winter (included), and two on social choice theory, by Donald Saari (included) and Felix Brandt (included). These tutori- als were part of a special PhD programme, where PhD students also had the opportunity to present their work in progress. I am very grateful to the members of the Programme Committee and the external referees for their care and diligence in reviewing the submitted papers. I would also like to thank the Faculty of Philosophy of the Erasmus University in Rotterdam for having accepted to host this conference, in particular Willy Ophelders, Amanda Koopman, Linda Degener and Lizzy Patilaya for their as- sistance. I also gratefully appreciate the excellent facilities offered by the Easy- Chair conference administration system. Last but not least I would like to thank the European Science Foundation (ESF) and the Erasmus Trust Fund for their generous financial support. March 2011 Harrie de Swart Conference Organization Programme Chair Harrie de Swart Rotterdam, The Netherlands Programme Committee Rudolf Berghammer University of Kiel, Germany Felix Brandt Technical University Munich, Germany Jules Desharnais Laval University, Canada Ulle Endriss University of Amsterdam, The Netherlands Marcelo Frias University of Buenos Aires, Argentina Hitoshi Furusawa University of Kagoshima, Japan Peter H¨ofner University of Augsburg, Germany Ali Jaoua University of Qatar, Qatar Peter Jipsen Chapman University, USA Wolfram Kahl McMaster University, Canada Larissa Meinicke Macquarie University, Sydney, Australia Bernhard M¨oller University of Augsburg, Germany Ewa Orlowska National Institute of Telecommunications, Warsaw, Poland Agnieszka Rusinowska University of Paris 1, France Gunther Schmidt UniBw Munich, Germany Renate Schmidt University of Manchester, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada External Reviewers Bernd Brassel Martin Eric Mueller Han-Hing Dang Koki Nishizawa Guillaume Feuillade Ingrid Rewitzky Roland Gl¨uck Patrick Roocks Timothy Griffin Kim Solin Annabelle McIver Toshinori Takai Roger Maddux Dmitry Tishkovsky Sponsors LogiCCC programme of the European Science Foundation (ESF) Erasmus Trust Fund, Rotterdam Faculty of Philosophy, Erasmus University, Rotterdam Table of Contents Building Structured Theories (Invited Paper) ........................ 1 Bernhard M¨oller Social Networks: Prestige, Centrality, and Influence (Invited Paper) .... 22 Agnieszka Rusinowska, Rudolf Berghammer, Harrie De Swart, and Michel Grabisch Synthesising Terminating Tableau Calculi for Relational Logics (Invited Paper) .................................................. 40 Renate A. Schmidt From Arrow’s Impossibility to Schwartz’s Tournament Equilibrium Set (Invited Tutorial) ................................................ 50 Felix Brandt Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL (Invited Tutorial).................................... 52 Simon Foster, Georg Struth, and Tjark Weber Explaining Voting Paradoxes; Including Arrow’s and Sen’s Theorems (Invited Tutorial) ................................................ 68 Donald G. Saari Relation Algebraic Approaches to Fuzzy Relations (Invited Tutorial) ... 70 Michael Winter A First-Order Calculus for Allegories ............................... 74 Bahar Aameri and Michael Winter Relational Modelling and Solution of Chessboard Problems ............ 92 Rudolf Berghammer A Functional, Successor List Based Version of Warshall’s Algorithm with Applications ................................................ 109 Rudolf Berghammer Variable Side Conditions and Greatest Relations in Algebraic Separation Logic ................................................. 125 Han-Hing Dang and Peter H¨ofner An Algebraic Approach to Preference Relations ...................... 141 Ivo D¨untsch and Ewa Orlowska VIII Table of Contents Relational and Multirelational Representation Theorems for Complete Idempotent Left Semirings ........................................ 148 Hitoshi Furusawa and Koki Nishizawa Using Bisimulations for Optimality Problems in Model Refinement ..... 164 Roland Gl¨uck Pathfinding Through Congruences ................................. 180 Alexander J.T. Gurney and Timothy G. Griffin Towards a Typed Omega Algebra .................................. 196 Walter Guttmann Towards an Algebra of Routing Tables .............................. 212 Peter H¨ofner and Annabelle McIver Dependently-Typed Formalisation of Relation-Algebraic Abstractions ... 230 Wolfram Kahl Omega Algebras and Regular Equations ............................ 248 Michael R. Laurence and Georg Struth On Probabilistic Kleene Algebras, Automata and Simulations ......... 264 Annabelle McIver, Tahiry M. Rabehaja, and Georg Struth Ampersand: Applying Relation Algebra in Practice ................... 280 Gerard Michels, Sebastiaan Joosten,