Relational Methods in Computer Science [electronic resource] : 6th International Conference, RelMiCS 2001 and 1st Workshop of COST Action 274 TARSKI Oisterwijk, The Netherlands, October 16–21, 2001 Revised Papers / edited by Harrie C. M. Swart.
Material type:
TextSeries: Lecture Notes in Computer Science ; 2561Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002Description: X, 318 p. online resourceContent type: - text
- computer
- online resource
- 9783540362807
- Computer science
- Software engineering
- Algebra -- Data processing
- Artificial intelligence
- Algebra
- Computer Science
- Mathematical Logic and Formal Languages
- Software Engineering
- Symbolic and Algebraic Manipulation
- Artificial Intelligence (incl. Robotics)
- Category Theory, Homological Algebra
- Order, Lattices, Ordered Algebraic Structures
- 005.131 23
- QA8.9-QA10.3
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK4261 |
Invited Lecture -- A Relation-Algebraic Approach to Graph Structure Transformation -- Contributed Papers -- Emptiness Relations in Property Systems -- Pregroups: Models and Grammars -- Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View -- Interpretability of First—Order Dynamic Logic in a Relational Calculus -- Relations in GUHA Style Data Mining -- Groups in Allegories -- Distributed Conceptual Structures -- A Computer Algebra Approach to Relational Systems Using Gröbner Bases -- Fuzzy Relational Images in Computer Science -- A Completeness Theorem for Extended Order Dependencies on Relational Attribute Models in Dedekind Categories -- Double Residuated Lattices and Their Applications -- Interval Bilattices and Some Other Simple Bilattices -- Interactive Systems: From Folklore to Mathematics -- Relational Constructions in Goguen Categories -- A Subintuitionistic Logic and Some of Its Methods -- Implementation of Relational Algebra Using Binary Decision Diagrams -- Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs -- Calculating Church-Rosser Proofs in Kleene Algebra -- On the Definition and Representation of a Ranking -- Tangent Circle Algebras.
There are no comments on this title.