Lecture Notes in Computer Science 6663

Transcription

1 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

2 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

3 Volume Editor Harrie de Swart Erasmus University Rotterdam Faculty of Philosophy P.O. Box 1738, 3000 DR Rotterdam, The Netherlands ISSN e-issn ISBN e-isbn DOI / 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 (

4 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 conference took place in Rotterdam, The Netherlands, from May 30 to June 3, 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 Banach 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öller (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 tutorials 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 assistance. 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

5 Conference Organization Programme Chair Harrie de Swart Programme Committee Rudolf Berghammer Felix Brandt Jules Desharnais Ulle Endriss Marcelo Frias Hitoshi Furusawa Peter Höfner Ali Jaoua Peter Jipsen Wolfram Kahl Larissa Meinicke Bernhard Möller Ewa Orlowska Agnieszka Rusinowska Gunther Schmidt Renate Schmidt Georg Struth Michael Winter External Reviewers Bernd Brassel Han-Hing Dang Guillaume Feuillade Roland Glück Timothy Griffin Annabelle McIver Roger Maddux Rotterdam, The Netherlands University of Kiel, Germany Technical University Munich, Germany Laval University, Canada University of Amsterdam, The Netherlands University of Buenos Aires, Argentina University of Kagoshima, Japan University of Augsburg, Germany University of Qatar, Qatar Chapman University, USA McMaster University, Canada Macquarie University, Sydney, Australia University of Augsburg, Germany National Institute of Telecommunications, Warsaw, Poland University of Paris 1, France UniBw Munich, Germany University of Manchester, UK University of Sheffield, UK Brock University, Canada Martin Eric Mueller Koki Nishizawa Ingrid Rewitzky Patrick Roocks Kim Solin Toshinori Takai Dmitry Tishkovsky Sponsors LogiCCC programme of the European Science Foundation (ESF) Erasmus Trust Fund, Rotterdam Faculty of Philosophy, Erasmus University, Rotterdam

6 Table of Contents Building Structured Theories (Invited Paper)... 1 Bernhard Möller Social Networks: Prestige, Centrality, and Influence (Invited Paper) Agnieszka Rusinowska, Rudolf Berghammer, Harrie De Swart, and Michel Grabisch Synthesising Terminating Tableau Calculi for Relational Logics (Invited Paper) Renate A. Schmidt From Arrow s Impossibility to Schwartz s Tournament Equilibrium Set (Invited Tutorial) Felix Brandt Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL (Invited Tutorial) Simon Foster, Georg Struth, and Tjark Weber Explaining Voting Paradoxes; Including Arrow s and Sen s Theorems (Invited Tutorial) Donald G. Saari Relation Algebraic Approaches to Fuzzy Relations (Invited Tutorial) Michael Winter A First-Order Calculus for Allegories Bahar Aameri and Michael Winter Relational Modelling and Solution of Chessboard Problems Rudolf Berghammer A Functional, Successor List Based Version of Warshall s Algorithm with Applications Rudolf Berghammer Variable Side Conditions and Greatest Relations in Algebraic Separation Logic Han-Hing Dang and Peter Höfner An Algebraic Approach to Preference Relations Ivo Düntsch and Ewa Or lowska

7 VIII Table of Contents Relational and Multirelational Representation Theorems for Complete Idempotent Left Semirings Hitoshi Furusawa and Koki Nishizawa Using Bisimulations for Optimality Problems in Model Refinement Roland Glück Pathfinding Through Congruences Alexander J.T. Gurney and Timothy G. Griffin Towards a Typed Omega Algebra Walter Guttmann Towards an Algebra of Routing Tables Peter Höfner and Annabelle McIver Dependently-Typed Formalisation of Relation-Algebraic Abstractions Wolfram Kahl Omega Algebras and Regular Equations Michael R. Laurence and Georg Struth On Probabilistic Kleene Algebras, Automata and Simulations Annabelle McIver, Tahiry M. Rabehaja, and Georg Struth Ampersand: Applying Relation Algebra in Practice Gerard Michels, Sebastiaan Joosten, Jaap van der Woude, and Stef Joosten Programming from Galois Connections Shin-Cheng Mu and José Nuno Oliveira Constructions around Partialities Gunther Schmidt Splitting Atoms in Relational Algebras Prathap Siddavaatam and Michael Winter Relational Heterogeneity Relaxed by Subtyping Jaap van der Woude and Stef Joosten Author Index