Relational Methods in Computer Science [electronic resource] : 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers / edited by Wendy MacCaull, Michael Winter, Ivo Düntsch.

Contributor(s): MacCaull, Wendy [editor.] | Winter, Michael [editor.] | Düntsch, Ivo [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 3929Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: VIII, 262 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540333401Subject(s): Computer science | Software engineering | Logic design | Computational complexity | Algebra -- Data processing | Artificial intelligence | Computer Science | Mathematical Logic and Formal Languages | Software Engineering | Logics and Meanings of Programs | Symbolic and Algebraic Manipulation | Artificial Intelligence (incl. Robotics) | Discrete Mathematics in Computer ScienceAdditional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access online
Contents:
Invited Papers -- Topological Representation of Precontact Algebras -- Relational Semantics Through Duality -- Duality Theory for Projective Algebras -- Contributed Papers -- Relational Approach to Boolean Logic Problems -- Static Analysis of Programs Using Omega Algebra with Tests -- Weak Contact Structures -- On Relational Cycles -- A Framework for Kleene Algebra with an Embedded Structure -- Non-termination in Unifying Theories of Programming -- Towards an Algebra of Hybrid Systems -- Relational Correspondences for Lattices with Operators -- Control-Flow Semantics for Assembly-Level Data-Flow Graphs -- Relational Implementation of Simple Parallel Evolutionary Algorithms -- Lattice-Based Paraconsistent Logic -- Verification of Pushdown Systems Using Omega Algebra with Domain -- wp Is wlp -- Relational Representability for Algebras of Substructural Logics -- Knuth-Bendix Completion as a Data Structure -- Quantifier Elimination in Elementary Set Theory -- Time-Dependent Contact Structures in Goguen Categories.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4045

Invited Papers -- Topological Representation of Precontact Algebras -- Relational Semantics Through Duality -- Duality Theory for Projective Algebras -- Contributed Papers -- Relational Approach to Boolean Logic Problems -- Static Analysis of Programs Using Omega Algebra with Tests -- Weak Contact Structures -- On Relational Cycles -- A Framework for Kleene Algebra with an Embedded Structure -- Non-termination in Unifying Theories of Programming -- Towards an Algebra of Hybrid Systems -- Relational Correspondences for Lattices with Operators -- Control-Flow Semantics for Assembly-Level Data-Flow Graphs -- Relational Implementation of Simple Parallel Evolutionary Algorithms -- Lattice-Based Paraconsistent Logic -- Verification of Pushdown Systems Using Omega Algebra with Domain -- wp Is wlp -- Relational Representability for Algebras of Substructural Logics -- Knuth-Bendix Completion as a Data Structure -- Quantifier Elimination in Elementary Set Theory -- Time-Dependent Contact Structures in Goguen Categories.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha