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