default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. RelMiCS 1997: Hammamet, Tunisia
- Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, January 6-10, 1997, Hammamet, Tunisia. 1997
Categories
- Yasuo Kawahara, Hitoshi Furusawa, Masao Mori:
Categorical Representation Theorems of Fuzzy Relations. RelMiCS 1997: 1-10 - Michael Winter:
A Relation Algebraic Approach to Interaction Categories. RelMiCS 1997: 11-18 - Jean-Pierre Olivier:
Oriented, Binary, Ordered Trees and Forests Distributive Allegories. RelMiCS 1997: 19-28
Fuzzyness
- Masao Mori, Yasuo Kawahara:
Fuzzy Graph Rewritings. RelMiCS 1997: 29-38 - Sadok Ben Yahia, Habib Ounalli, Ali Jaoua:
Dynamic fuzzy functional dependency. RelMiCS 1997: 39-50
Difuntionality, Special relations
- Habib Ounalli, Ali Jaoua:
Fuzzy Difunctional Dependencles. RelMiCS 1997: 51-62 - Raoudha Khchérif, Ali Jaoua, Mohamed Mohsen Gammoudi:
Using Difunctional Relation for Information Organization. RelMiCS 1997: 63-72 - Karim Belaid, Bahri Cherif, Othman Echi:
Some Properties of Spectral Binary Relations. RelMiCS 1997: 73-79 - Hajnal Andréka, Ian M. Hodkinson, István Németi:
The finite base property for some cylindric-relativized algebras (Abstract). RelMiCS 1997: 81
Rewriting
- Yoshihiro Mizoguchi:
Properties of Graphs Preserved by Relational Graph Rewritings. RelMiCS 1997: 83-89 - Wolfram Kahl:
Relational Matching for Graphical Calculi of Relations. RelMiCS 1997: 91-100
Programming
- Bernd-Holger Schlingloff:
Modelling Message Buffers with Binary Decision Diagrams. RelMiCS 1997: 101-111 - Bernhard Möller:
Calculating With Pointer Structures (Extended Abstract). RelMiCS 1997: 113-122 - Barry Dwyer:
Relational Programming in Libra. RelMiCS 1997: 123-132 - Rym Salem, Khaled Bsaïes:
Mechanizing Proofs by Unfolding, Folding and Simplification. RelMiCS 1997: 133-142
Semantics
- Chris Brink, Ingrid Rewitzky:
Predicate Relators. RelMiCS 1997: 143-156 - Wendy MacCaull:
Semantics for Logics without Contraction Using Ternary Relations. RelMiCS 1997: 157-165
Protocols, Agents
- Lotfi Majdoub, Yahya Slimani:
Defining Levels of Correctness for Parallel Programs with Temporal Logic of Actions. RelMiCS 1997: 167-176 - Gheorghe Stefanescu:
Axiomatizing Mixed Relations. RelMiCS 1997: 177-186 - Noureddine Boudriga, Sihem Guemara-ElFatmi:
Formal Protocol Description: Model and validation. RelMiCS 1997: 187-203
Axiomatics and Expressiveness
- Marcelo F. Frias, Roger D. Maddux:
Completeness of the Relational Calculus MU2. RelMiCS 1997: 205-214 - Vera Stebletsova, Yde Venema:
Axioms for Jonsson's Q-Algebras. RelMiCS 1997: 215-224 - Maarten Marx:
Relation Algebras Can Tile. RelMiCS 1997: 225-238 - Szabolcs Mikulás:
A note on expressing infinity in cylindrlc-relativised set algebras. RelMiCS 1997: 239-243 - Robin Hirsch:
The Finite Representable Relation Algebras are not Recursive (Abstract). RelMiCS 1997: 245
Algorithms and Programs
- Jifeng He:
Linking Theories in Probabilistic Programming. RelMiCS 1997: 247-256 - Ingrid Rewitzky:
Programs as binary multirelations. RelMiCS 1997: 257-272 - Fatma Mili, Ali Mili:
Algorithms = RelationaI Algebra + Ordering Relations. RelMiCS 1997: 273-289 - Jesus Ravelo:
Calculating with Relations for Graph Algorithmics. RelMiCS 1997: 291-300 - Rym Mili, Lamia Labed Jilani, Ali Mili:
Measures of Distances to Perform Approximate Retrieval. RelMiCS 1997: 301-307 - Rudolf Berghammer, Burghard von Karger:
Computing Kernels in Bicromatic Directed Relations (Abstract). RelMiCS 1997: 309
History and Nonclassical Aspects
- Michael Böttner:
Visiting Some Relatives of Peirce's. RelMiCS 1997: 311-320 - Marcelo F. Frias, Ewa Orlowska:
Equational Reasoning in Non-Classical Logics. RelMiCS 1997: 321-329
Products, Forks and Parallelism
- Stéphane Demri, Ewa Orlowska:
Reasoning with Relational Demonic Operators. RelMiCS 1997: 331-340 - Claudia Hattensperger, Peter Kempf:
Towards a Formal Framework for Heterogeneous Relation Algebra. RelMiCS 1997: 341-349 - Marcelo F. Frias, Gabriel Baum, Armando Martin Haeberer:
Representability and Program Construction within Fork Algebras (Part II). RelMiCS 1997: 351-358 - Jules Desharnais:
Monomorphic Characterization of n-ary direct products. RelMiCS 1997: 359-368
Supplement
- Vera Stebletsova:
Weakly Assoclative Relation Algebras with Polyadic Compositlons. RelMiCS 1997: 369-375
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
