Conferences in DBLP

Relational Methods in Computer Science (RelMiCS) (RelMiCS)
1997 (conf/RelMiCS/1997)

1. Yasuo Kawahara, Hitoshi Furusawa, Masao Mori
   Categorical Representation Theorems of Fuzzy Relations. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:1-10 [Conf]
   
2. Michael Winter
   A Relation Algebraic Approach to Interaction Categories. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:11-18 [Conf]
   
3. Jean-Pierre Olivier
   Oriented, Binary, Ordered Trees and Forests Distributive Allegories. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:19-28 [Conf]
   
4. Masao Mori, Yasuo Kawahara
   Fuzzy Graph Rewritings. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:29-38 [Conf]
   
5. Sadok Ben Yahia, Habib Ounalli, Ali Jaoua
   Dynamic fuzzy functional dependency. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:39-50 [Conf]
   
6. Habib Ounalli, Ali Jaoua
   Fuzzy Difunctional Dependencles. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:51-62 [Conf]
   
7. Raoudha Khchérif, Ali Jaoua, Mohamed M. Gammoudi
   Using Difunctional Relation for Information Organization. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:63-72 [Conf]
   
8. Karim Belaid, Bahri Cherif, Othman Echi
   Some Properties of Spectral Binary Relations. [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:73-79 [Conf]
   
9. Hajnal Andréka, Ian M. Hodkinson, István Németi
   The finite base property for some cylindric-relativized algebras (Abstract). [Citation Graph (0, 0)][DBLP]
   RelMiCS, 1997, pp:81- [Conf]
   
10. Yoshihiro Mizoguchi
    Properties of Graphs Preserved by Relational Graph Rewritings. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:83-89 [Conf]
    
11. Wolfram Kahl
    Relational Matching for Graphical Calculi of Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:91-100 [Conf]
    
12. Bernd-Holger Schlingloff
    Modelling Message Buffers with Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:101-111 [Conf]
    
13. Bernhard Möller
    Calculating With Pointer Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:113-122 [Conf]
    
14. Barry Dwyer
    Relational Programming in Libra. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:123-132 [Conf]
    
15. Rym Salem, Khaled Bsaïes
    Mechanizing Proofs by Unfolding, Folding and Simplification. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:133-142 [Conf]
    
16. Chris Brink, Ingrid Rewitzky
    Predicate Relators. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:143-156 [Conf]
    
17. Wendy MacCaull
    Semantics for Logics without Contraction Using Ternary Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:157-165 [Conf]
    
18. Lotfi Majdoub, Yahya Slimani
    Defining Levels of Correctness for Parallel Programs with Temporal Logic of Actions. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:167-176 [Conf]
    
19. Gheorghe Stefanescu
    Axiomatizing Mixed Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:177-186 [Conf]
    
20. Noureddine Boudriga, Sihem Guemara-ElFatmi
    Formal Protocol Description: Model and validation. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:187-203 [Conf]
    
21. Marcelo F. Frias, Roger D. Maddux
    Completeness of the Relational Calculus MU2. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:205-214 [Conf]
    
22. Vera Stebletsova, Yde Venema
    Axioms for Jonsson's Q-Algebras. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:215-224 [Conf]
    
23. Maarten Marx
    Relation Algebras Can Tile. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:225-238 [Conf]
    
24. Szabolcs Mikulás
    A note on expressing infinity in cylindrlc-relativised set algebras. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:239-243 [Conf]
    
25. Robin Hirsch
    The Finite Representable Relation Algebras are not Recursive (Abstract). [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:245- [Conf]
    
26. Jifeng He
    Linking Theories in Probabilistic Programming. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:247-256 [Conf]
    
27. Ingrid Rewitzky
    Programs as binary multirelations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:257-272 [Conf]
    
28. Fatma Mili, Ali Mili
    Algorithms = RelationaI Algebra + Ordering Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:273-289 [Conf]
    
29. Jesus Ravelo
    Calculating with Relations for Graph Algorithmics. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:291-300 [Conf]
    
30. Rym Mili, Lamia Labed Jilani, Ali Mili
    Measures of Distances to Perform Approximate Retrieval. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:301-307 [Conf]
    
31. Rudolf Berghammer, Burghard von Karger
    Computing Kernels in Bicromatic Directed Relations (Abstract). [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:309- [Conf]
    
32. Michael Böttner
    Visiting Some Relatives of Peirce's. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:311-320 [Conf]
    
33. Marcelo F. Frias, Ewa Orlowska
    Equational Reasoning in Non-Classical Logics. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:321-329 [Conf]
    
34. Stéphane Demri, Ewa Orlowska
    Reasoning with Relational Demonic Operators. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:331-340 [Conf]
    
35. Claudia Hattensperger, Peter Kempf
    Towards a Formal Framework for Heterogeneous Relation Algebra. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:341-349 [Conf]
    
36. Marcelo F. Frias, Gabriel Baum, Armando Martin Haeberer
    Representability and Program Construction within Fork Algebras (Part II). [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:351-358 [Conf]
    
37. Jules Desharnais
    Monomorphic Characterization of n-ary direct products. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:359-368 [Conf]
    
38. Vera Stebletsova
    Weakly Assoclative Relation Algebras with Polyadic Compositlons. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:369-375 [Conf]