## Relational Methods in Computer Science: 6th International Conference, RelMICS 2001, and 1st Workshop of COST Action 274 TARSKI Oisterwijk, The Netherlands, October 16-21, 2001, Revised PapersHarrie C.M. de Swart, Henricus C. M. de Swart This volume contains the papers presented at RelMiCS 2001, the 6th Int- national Conference on Relational Methods in Computer Science, and the First Workshop of COST Action 274TARSKI, Theory and Application of Relat- nal Structures as Knowledge Instruments. The conference was held in conference centre Boschoord, Oisterwijk near Tilburg, The Netherlands, from October 16 till October 21, 2001. The conference attracted interest from many parts of the world with contributions from many countries. This conference was a continuation of international conferences/workshops on Relational Methods in Computer Science held in: Schloss Dagstuhl, Germany, January1994;ParatinearRiodeJaneiro, September1995;Hammamet, Tunisia, January1997;theStefanBanachCenter, Warsaw, September1998;andQuebec, Canada, January 2000. The purpose of these conferences/workshops is to bring together researchers from various subdisciplines of Computer Science, Mathematics, and Philosophy, all of whom use relational methods as a conceptual and methodological tool in their work. Topics include, but are not limited to: relational, cylindric, fork, and Kleene algebras; relational proof theory and decidability issues; relational representation theorems; relational semantics; applications to programming, - tabases, andanalysisoflanguage;andcomputersystemsforrelationalknowledge representation. With respect to applications one can think of: relational spe- ?cations and modeling; relational software design and development techniques; programming with relations; and implementing relational algebra. |

### What people are saying - Write a review

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

### Contents

A RelationAlgebraic Approach to Graph Structure Transformation | 1 |

Emptiness Relations in Property Systems | 15 |

Models and Grammars | 35 |

Dynamic View | 50 |

Interpretability of FirstOrder Dynamic Logic in a Relational Calculus | 66 |

Relations in GUHA Style Data Mining | 81 |

Groups in Allegories | 88 |

Distributed Conceptual Structures | 104 |

Interval Bilattices and Some Other Simple Bilattices | 190 |

From Folklore to Mathematics | 197 |

Relational Constructions in Goguen Categories | 212 |

A Subintuitionistic Logic and Some of Its Methods | 228 |

Implementation of Relational Algebra Using Binary Decision Diagrams | 241 |

Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs | 258 |

Calculating ChurchRosser Proofs in Kleene Algebra | 276 |

On the Definition and Representation of a Ranking | 291 |

A Computer Algebra Approach to Relational Systems Using Grobner Bases | 124 |

Fuzzy Relational Images in Computer Science | 134 |

A Completeness Theorem for Extended Order Dependencies on Relational Attribute Models in Dedekind Categories | 152 |

Double Residuated Lattices and Their Applications | 171 |

Tangent Circle Algebras | 300 |

314 | |

### Other editions - View all

### Common terms and phrases

abstract adjoint algorithm allegories applications assume attributes axioms bilattice binary operation binary relations bonding pair Boolean calculus called Church-Rosser theorems classification closure complete lattice composition Computer Science concept lattice crisp Dedekind categories deﬁned Deﬁnition denote depth(w direct image element EODs equations equivalent example ﬁnite ﬁrst Formal Concept Analysis functor fuzzy relation fuzzy set given graph grids hence holds homomorphisms implication induction inference rules infomorphism inst(A instance isomorphic Kleene algebra language left right Lemma length(A Mathematics modal logic monoid monotonic function morphism nodes Ô Ô Ô objects Orlowska p.o. monoid predicate preorder Proof properties Proposition pushout R]}-free formulas relation-algebraic relational algebra relational infomorphisms RelMiCS RelView representation residuated lattices resp result rewriting ROBDD satisﬁed satisfying semantics Springer-Verlag structure subset theory typ(A univalent variables