3. RelMiCS 1997: Hammamet, Tunisia

@proceedings{DBLP:conf/RelMiCS/1997,
  title     = {Participants Copies of Third International Seminar on the Use
               of Relational Methods in Computer Science, January 6-10, 1997,
               Hammamet, Tunisia},
  booktitle = {RelMiCS},
  year      = {1997},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Categories

• Yasuo Kawahara, Hitoshi Furusawa, Masao Mori: Categorical Representation Theorems of Fuzzy Relations. 1-10
• Michael Winter: A Relation Algebraic Approach to Interaction Categories. 11-18
• Jean-Pierre Olivier: Oriented, Binary, Ordered Trees and Forests Distributive Allegories. 19-28

Fuzzyness

• Masao Mori, Yasuo Kawahara: Fuzzy Graph Rewritings. 29-38
• Sadok Ben Yahia, Habib Ounalli, Ali Jaoua: Dynamic fuzzy functional dependency. 39-50

Difuntionality, Special relations

• Habib Ounalli, Ali Jaoua: Fuzzy Difunctional Dependencles. 51-62
• Raoudha Khchérif, Ali Jaoua, Mohamed M. Gammoudi: Using Difunctional Relation for Information Organization. 63-72
• Karim Belaid, Bahri Cherif, Othman Echi: Some Properties of Spectral Binary Relations. 73-79
• Hajnal Andréka, Ian M. Hodkinson, István Németi: The finite base property for some cylindric-relativized algebras (Abstract). 81

Rewriting

• Yoshihiro Mizoguchi: Properties of Graphs Preserved by Relational Graph Rewritings. 83-89
• Wolfram Kahl: Relational Matching for Graphical Calculi of Relations. 91-100

Programming

• Bernd-Holger Schlingloff: Modelling Message Buffers with Binary Decision Diagrams. 101-111
• Bernhard Möller: Calculating With Pointer Structures (Extended Abstract). 113-122
• Barry Dwyer: Relational Programming in Libra. 123-132
• Rym Salem, Khaled Bsaïes: Mechanizing Proofs by Unfolding, Folding and Simplification. 133-142

Semantics

• Chris Brink, Ingrid Rewitzky: Predicate Relators. 143-156
• Wendy MacCaull: Semantics for Logics without Contraction Using Ternary Relations. 157-165

Protocols, Agents

• Lotfi Majdoub, Yahya Slimani: Defining Levels of Correctness for Parallel Programs with Temporal Logic of Actions. 167-176
• Gheorghe Stefanescu: Axiomatizing Mixed Relations. 177-186
• Noureddine Boudriga, Sihem Guemara-ElFatmi: Formal Protocol Description: Model and validation. 187-203

Axiomatics and Expressiveness

• Marcelo F. Frias, Roger D. Maddux: Completeness of the Relational Calculus MU2. 205-214
• Vera Stebletsova, Yde Venema: Axioms for Jonsson's Q-Algebras. 215-224
• Maarten Marx: Relation Algebras Can Tile. 225-238
• Szabolcs Mikulás: A note on expressing infinity in cylindrlc-relativised set algebras. 239-243
• Robin Hirsch: The Finite Representable Relation Algebras are not Recursive (Abstract). 245

Algorithms and Programs

• Jifeng He: Linking Theories in Probabilistic Programming. 247-256
• Ingrid Rewitzky: Programs as binary multirelations. 257-272
• Fatma Mili, Ali Mili: Algorithms = RelationaI Algebra + Ordering Relations. 273-289
• Jesus Ravelo: Calculating with Relations for Graph Algorithmics. 291-300
• Rym Mili, Lamia Labed Jilani, Ali Mili: Measures of Distances to Perform Approximate Retrieval. 301-307
• Rudolf Berghammer, Burghard von Karger: Computing Kernels in Bicromatic Directed Relations (Abstract). 309

History and Nonclassical Aspects

• Michael Böttner: Visiting Some Relatives of Peirce's. 311-320
• Marcelo F. Frias, Ewa Orlowska: Equational Reasoning in Non-Classical Logics. 321-329

Products, Forks and Parallelism

• Stéphane Demri, Ewa Orlowska: Reasoning with Relational Demonic Operators. 331-340
• Claudia Hattensperger, Peter Kempf: Towards a Formal Framework for Heterogeneous Relation Algebra. 341-349
• Marcelo F. Frias, Gabriel Baum, Armando Martin Haeberer: Representability and Program Construction within Fork Algebras (Part II). 351-358
• Jules Desharnais: Monomorphic Characterization of n-ary direct products. 359-368

Supplement

• Vera Stebletsova: Weakly Assoclative Relation Algebras with Polyadic Compositlons. 369-375