The SCEAS System
Navigation Menu

Conferences in DBLP

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

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