## 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 PapersR. Berghammer, Bernhard Möller, Georg Struth This volume contains the proceedings of the 7th International Seminar on - lational Methods in Computer Science (RelMiCS 7) and the 2nd International Workshop onApplications ofKleeneAlgebra.Thecommonmeetingtookplacein Bad Malente (near Kiel), Germany,from May May 12–17,2003.Its purpose was to bring together researchers from various subdisciplines of Computer Science, Mathematics and related ?elds who use the calculi of relations and/or Kleene algebra as methodological and conceptual tools in their work. This meeting is the joint continuation of two di?erent series of meetings. Previous RelMiCS seminars were held in Schloss Dagstuhl (Germany) in J- uary 1994, Parati (Brazil) in July 1995, Hammamet (Tunisia) in January 1997, Warsaw (Poland) in September 1998, Quebec (Canada) in January 2000, and Oisterwijk (The Netherlands) in October 2001. The ?rst workshop on appli- tions of Kleene algebra was also held in Schloss Dagstuhl in February 2001. To join these two events in a common meeting was mainly motivated by the s- stantialcommoninterestsandoverlapofthetwocommunities.Wehopethatthis leads to fruitful interactions and opens new and interesting research directions. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Choice Procedures in Pairwise Comparison MultipleAttribute Decision Making Methods | 1 |

Kleene Algebra with Relations | 8 |

Integrating Model Checking and Theorem Proving for Relational Reasoning | 21 |

FixedPoint Characterisation of Winning Strategies in Impartial Games | 34 |

Checking the Shape Safety of Pointer Manipulations | 48 |

Applying Relational Algebra in 3D Graphical Software Design | 62 |

Investigating Discrete Controllability with Kleene Algebra | 74 |

Tracing Relations Probabilistically | 86 |

Relations and GUHAStyle Data Mining II | 163 |

A Note on Complex Algebras of Semigroups | 171 |

Calculational RelationAlgebraic Proofs in IsabelleIsar | 178 |

A Calculus of Typed Relations | 191 |

GreedyLike Algorithms in Modal Kleene Algebra | 202 |

RasiowaSikorski Style Relational Elementary Set Theory | 215 |

Relational Data Analysis | 227 |

Two Proof Systems for Peirce Algebras | 238 |

Pointer Kleene Algebra | 99 |

Kleene Modules | 112 |

The Categories of Kleene Algebras Action Algebras and Action Lattices Are Related by Adjunctions | 124 |

Towards a Formalisation of Relational Database Theory in Constructive Type Theory | 137 |

SCAN Is Complete for All Sahlqvist Formulae | 149 |

An Institution Isomorphism for Planar Graph Colouring | 252 |

Decomposing Relations into Orderings | 265 |

278 | |

### Other editions - View all

Relational and Kleene-Algebraic Methods in Computer Science: 7th ... R. Berghammer,Bernhard Möller,Georg Struth No preview available - 2014 |

Relational and Kleene-Algebraic Methods in Computer Science: 7th ... R. Berghammer,Bernhard Möller,Georg Struth No preview available - 2004 |

### Common terms and phrases

abstract action algebras algorithms allegories Alloy applied Athena axiomatic axioms Berghammer binary operator binary relation Boolean algebra calculational checking clause codomain colouring Computer Science construction context corresponding decomposition defined Deﬁnition denote derivation diagrams difunctional domain elements equational equivalent example finite first-order first-order logic FL sketch formalisation function functor Galois connection graph idempotent induction isomorphism Kleene algebra Kozen labeled language lattice Lemma LNCS matrices modal logic Möller monotonic morphisms nodes notation operations Orlowska Peirce algebra Peirce logic pointer structures Polish space position predicate transformers probabilistic relations proof system properties propositional prove quantifiers Rasiowa-Sikorski reachable relation algebra relation-algebraic RelMiCS/Kleene-Algebra Ws 2003 RelView representation residuals result rules Sahlqvist formulae satisfying scalar sequence setoid Skolem Springer Springer-Verlag subset surjective Theorem tree tuples typed relations unary univalent and surjective valid variable winning