000 | 03282nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-33340-1 | ||
003 | DE-He213 | ||
005 | 20170628034503.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540333401 _9978-3-540-33340-1 |
||
024 | 7 |
_a10.1007/11734673 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
100 | 1 |
_aMacCaull, Wendy. _eeditor. |
|
245 | 1 | 0 |
_aRelational Methods in Computer Science _h[electronic resource] : _b8th 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 / _cedited by Wendy MacCaull, Michael Winter, Ivo Düntsch. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006. |
|
300 |
_aVIII, 262 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3929 |
|
505 | 0 | _aInvited 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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aComputational complexity. | |
650 | 0 |
_aAlgebra _xData processing. |
|
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aWinter, Michael. _eeditor. |
|
700 | 1 |
_aDüntsch, Ivo. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540333395 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3929 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/11734673 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
999 |
_c20097 _d20097 |