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