6. RelMiCS 2001: Oisterwijk, The Netherlands
Harrie C. M. de Swart (Ed.): 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 Papers. Springer 2002 Lecture Notes in Computer Science ISBN 3-540-00315-0
Invited Lecture
- Wolfram Kahl: A Relation-Algebraic Approach to Graph Structure Transformation. 1-14
Algebraic and Logical Foundations of 'Real World' Relations
- Philippe Balbiani: Emptiness Relations in Property Systems. 15-34
- Wojciech Buszkowski: Pregroups: Models and Grammars. 35-49
- Ernst-Erich Doberkat, Eugenio G. Omodeo: Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View. 50-65
- Marcelo F. Frias, Gabriel Baum, T. S. E. Maibaum: Interpretability of First-Order Dynamic Logic in a Relational Calculus. 66-80
- Petr Hájek: Relations in GUHA Style Data Mining. 81-87
- Yasuo Kawahara: Groups in Allegories. 88-103
- Robert E. Kent: Distributed Conceptual Structures. 104-123
- Luis M. Laita, Eugenio Roanes-Lozano, Luis de Ledesma, Tomasa Calvo, León González-Sotos: A Computer Algebra Approach to Relational Systems Using Gröbner Bases. 124-133
- Mike Nachtegael, Martine De Cock, Dietrich Van der Weken, Etienne E. Kerre: Fuzzy Relational Images in Computer Science. 134-151
- Hitomi Okuma, Yasuo Kawahara: A Completeness Theorem for Extended Order Dependencies on Relational Attribute Models in Dedekind Categories. 152-170
- Agata Pilitowska: Interval Bilattices and Some Other Simple Bilattices. 190-196
- Gheorghe Stefanescu: Interactive Systems: From Folklore to Mathematics. 197-211
- Michael Winter: Relational Constructions in Goguen Categories. 212-227
- Ernst Zimmermann: A Subintuitionistic Logic and Some of Its Methods. 228-240
Mechanisation of Relational Reasoning
- Rudolf Berghammer, Barbara Leoniuk, Ulf Milanese: Implementation of Relational Algebra Using Binary Decision Diagrams. 241-257
- Rudolf Berghammer, Thorsten Hoffmann: Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs. 258-275
- Georg Struth: Calculating Church-Rosser Proofs in Kleene Algebra. 276-290
Relational Scaling and Preferences
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T193522 by the dblp team