4. RelMiCS 1998: Warsaw, Poland

@proceedings{DBLP:conf/RelMiCS/1998,
  editor    = {Ewa Orlowska and
               Andrzej Szalas},
  title     = {Participants Copies for Relational Methods in Logic, Algebra
               and Computer Science, 4th International Seminar RelMiCS, Warsaw,
               Poland, Septermber 14-20, 1998},
  booktitle = {RelMiCS},
  year      = {1998},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Rahma Ben Ayed, Hafedh Mili, Ali Mili: Capturing pointer semantics and scoping rules. 3-7 BibTeX
• Roland Carl Backhouse: Pair algebras and Galois connections. 8-12 BibTeX
• Philippe Balbiani, Dimiter Vakarelov: Extending arrow logic. 13-17 BibTeX
• Johan van Benthem: Modality, relational guards, and decidability (invited paper). 18 BibTeX
• Rudolf Berghammer: Using RELVIEW to solve problems on relation-based discrete structures. 19-23 BibTeX
• Michael Böttner: Number in Peirce grammar. 24-28 BibTeX
• Khaled Bsaïes, Fathi Hammami, Ali Jaoua, Wassim Ksontini: May reasoning be reduced to an information retrieval problem? 29-32 BibTeX
• Wojciech Buszkowski: More on embeddings of residuated semigroups into algebras of binary relations. 33-36 BibTeX
• Marcos A. Castilho, Luis Fariñas del Cerro, Olivier Gasquet, Andreas Herzig: Modal tableaux based on graph-rules. 37-42 BibTeX
• Stéphane Demri: Coping with semilattices of relations in logics with relative accessibility relations. 43-47 BibTeX
• Stéphane Demri, Ewa Orlowska: Classes of modal frames definable by closure relational operations. 48-52 BibTeX
• Jules Desharnais, Ridha Khédri, Ali Mili: Towards a uniform relational semantics for tabular expressions. 53-57 BibTeX
• Barbara Dobrowolska: Relational proof system for natural language. 58-62 BibTeX
• Ivo Düntsch, Hui Wang, Steven McCloskey: Relation algebras in spatial reasoning (invited paper). 63-68 BibTeX
• Barry Dwyer: Translating relational programs into PROLOG. 69-74 BibTeX
• Marcelo F. Frias, Gabriel Baum, Armando Martin Haeberer: A calculus for program construction based on fork algebras, generic algorithms and design strategies. 75-79 BibTeX
• Lew Gordeev: Proof systems in relation algebra. 80-85 BibTeX
• H. Peter Gumm: Equational and implicational classes of co-algebras. 86-90 BibTeX
• Claudio Gutiérrez: Decidability of the equational theory of allegories. 91-96 BibTeX
• Jifeng He, C. A. R. Hoare: Unifying theories of programming. 97-99 BibTeX
• Robin Hirsch, Ian M. Hodkinson: Connections between cylindric algebras and relation algebras. 100-105 BibTeX
• Ian M. Hodkinson, Szabolcs Mikulás: Colorful reducts. 106-110 BibTeX
• Luisa Iturrioz: Relational representation theorems for some algebraic structures. 111 BibTeX
• Peter Jipsen: Sequential Q-algebras. 112-116 BibTeX
• Wolfram Kahl: Demonic diagrams - towards a graphical refinement calculus. 117-121 BibTeX
• Burghard von Karger: Computation calculus = sequential calculus + discreteness and termination. 122-126 BibTeX
• Yasuo Kawahara: Lattices in Dedekind categories. 127-131 BibTeX
• Miroslawa Kolowska-Gawiejnowics: Relational semantics for Lambek calculus. 132-137 BibTeX
• Beata Konikowska, Charles G. Morgan, Ewa Orlowska: Relational semantics for arbitrary finite valued logics. 138-143 BibTeX
• Waldemar Korczyniski: On a presentation of Petri nets and their morphisms. 144-147 BibTeX
• Joachim Lambek: Relations old and new (invited paper). 148-158 BibTeX
• Wendy MacCaull: A relational approach to association rules and functional dependencies. 159-164 BibTeX
• Bernhard Möller: Modal and temporal operators on partial orders. 165-169 BibTeX
• Ingrid Rewitzky: Duality and simulations. 170 BibTeX
• Marc Roubens: About fuzzy preference structures. 171-175 BibTeX
• Eric SanJuan, Luisa Iturrioz: An application of standard BAO theory to some information algebras. 176-181 BibTeX
• Antonino Salibra: The variety of lambda abstraction algebras does not admit n-permutable congruences for all n. 182-187 BibTeX
• Ron Seljée, Harrie C. M. de Swart: Three types of redundancy in integrity checking: An optimal solution. 188-191 BibTeX
• Renate A. Schmidt: Decidability by unrefined resolution for propositional modal logics. 192-196 BibTeX
• Gheorghe Stefanescu: On space-time duality in computing: Imperative programming versus wave computation. 197-201 BibTeX
• Marek Szczerba: Representation theorems for residuated groupoids. 202-205 BibTeX
• Michael Winter, Peter Kempf: Processes and relations. 206-209 BibTeX
• Artur Wolinski: Cylindric algebras for partial relational systems (Quasicylindric algebras). 210-215 BibTeX