Skip to main content
  • Conference proceedings
  • © 2006

Relational Methods in Computer Science

8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3929)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): RelMiCS: International Conference on Relational Methods in Computer Science

Conference proceedings info: RelMiCS 2005.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (20 papers)

  1. Front Matter

  2. Invited Papers

    1. Topological Representation of Precontact Algebras

      • Georgi Dimov, Dimiter Vakarelov
      Pages 1-16
    2. Relational Semantics Through Duality

      • Ewa Orłowska, Ingrid Rewitzky, Ivo Düntsch
      Pages 17-32
    3. Duality Theory for Projective Algebras

      • Alasdair Urquhart
      Pages 33-47
  3. Contributed Papers

    1. Relational Approach to Boolean Logic Problems

      • Rudolf Berghammer, Ulf Milanese
      Pages 48-59
    2. Static Analysis of Programs Using Omega Algebra with Tests

      • Claude Bolduc, Jules Desharnais
      Pages 60-72
    3. Weak Contact Structures

      • Ivo Düntsch, Michael Winter
      Pages 73-82
    4. On Relational Cycles

      • Alexander Fronk, Jörg Pleumann
      Pages 83-95
    5. Towards an Algebra of Hybrid Systems

      • Peter Höfner, Bernhard Möller
      Pages 121-133
    6. Relational Correspondences for Lattices with Operators

      • Jouni Järvinen, Ewa Orłowska
      Pages 134-146
    7. Control-Flow Semantics for Assembly-Level Data-Flow Graphs

      • Wolfram Kahl, Christopher K. Anand, Jacques Carette
      Pages 147-160
    8. Relational Implementation of Simple Parallel Evolutionary Algorithms

      • Britta Kehden, Frank Neumann, Rudolf Berghammer
      Pages 161-172
    9. Lattice-Based Paraconsistent Logic

      • Wendy MacCaull, Dimiter Vakarelov
      Pages 173-187
    10. Verification of Pushdown Systems Using Omega Algebra with Domain

      • Vincent Mathieu, Jules Desharnais
      Pages 188-199
    11. wp Is wlp

      • Bernhard Möller, Georg Struth
      Pages 200-211
    12. Relational Representability for Algebras of Substructural Logics

      • Ewa Orłowska, Anna Maria Radzikowska
      Pages 212-224
    13. Knuth-Bendix Completion as a Data Structure

      • Georg Struth
      Pages 225-236
    14. Quantifier Elimination in Elementary Set Theory

      • Ewa Orłowska, Andrzej Szałas
      Pages 237-248

Editors and Affiliations

  • Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, Canada

    Wendy MacCaull

  • Department of Computer Science, Brock University, St. Catharines, Canada

    Michael Winter

  • Computer Science Department, Brock University, St. Catharines, Canada

    Ivo Düntsch

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access