Relational Methods for Computer Science Applications

The reader thus gets an interdisciplinary spectrum of the state of the art of relational methods and implementation-oriented solutions of problems related to these areas.

Contents

Relations in Programming:

• J. Desharnais, R. Khédri, A. Mili: Interpretation of Tabular Expressions Using Arrays of Relations.
• B. Dwyer: Translating Relational Programs into Prolog.
• M.F. Frias, G.A. Baum, A.M. Haeberer: A Calculus for Program Contstruction Based on Fork Algebras, Design Strategies and Generic Algorithms.
• M. Winter, P. Kempf: Processes as Relations.

• W. MacCaull: A Tableaux Procedure for the Implication Problem for Association Rules.
• J. Kachniarz, A. Szalas: On a Static Verification of Integrity Constraints in Relational Databases.

• I. Düntsch: Contact Relation Algebras.
• J. Lambek: Relations Old and New.
• M. Szczerba: Relational Models for the Nonassociative Lambek Calculus.

• S. Demri: Coping with Semilattices of Relations in Logics with Relative Accessibility Relations.
• B. Konikowska, E. Orlowska: A Relational Formalisation of a Generic Many-Valued Modal Logic.
• E. San Juan, L. Iturrioz: An Application of Standard BAO Theory to Some Abstract Information Algebras.

• L. Gordeev: Proof Systems in Relation Algebra.
• R. Hirsch, I. Hodkinson: Connections Between Cylindric Algebras and Relation Algebras.
• Y. Kawahara: Lattices in Dedekind Categories.

• I. Düntsch, E. Orlowska: Beyond Modalities: Sufficiency and Mixed Algebras.
• A. Wolinski: Cylindric Algebras for Partial Relational Systems. Quasicylindric Algebras.