000 03987nam a22005775i 4500
001 978-3-540-78913-0
003 DE-He213
005 20240423130021.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540789130
_9978-3-540-78913-0
024 7 _a10.1007/978-3-540-78913-0
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aRelations and Kleene Algebra in Computer Science
_h[electronic resource] :
_b10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 7-11, 2008, Proceedings /
_cedited by Rudolf Berghammer, Bernhard Möller, Georg Struth.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aX, 402 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4988
505 0 _aFormal Methods and the Theory of Social Choice -- Relations Making Their Way from Logics to Mathematics and Applied Sciences -- Boolean Logics with Relations -- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables -- A Relation Algebraic Semantics for a Lazy Functional Logic Language -- Latest News about Demonic Algebra with Domain -- On the Structure of Demonic Refinement Algebras with Enabledness and Termination -- Multi-objective Problems in Terms of Relational Algebra -- The Lattice of Contact Relations on a Boolean Algebra -- A Non-probabilistic Relational Model of Probabilistic Kleene Algebras -- Increasing Bisemigroups and Algebraic Routing -- Lazy Relations -- The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy -- The Algebraic Approach II: Dioids, Quantales and Monads -- Automated Reasoning for Hybrid Systems — Two Case Studies — -- Non-termination in Idempotent Semirings -- Formal Concepts in Dedekind Categories -- The Structure of the One-Generated Free Domain Semiring -- Determinisation of Relational Substitutions in Ordered Categories with Domain -- Boolean Algebras and Stone Maps in Schröder Categories -- Cardinality in Allegories -- Solving Linear Equations in *-continuous Action Lattices -- Reactive Probabilistic Programs and Refinement Algebra -- Knowledge and Games in Modal Semirings -- Theorem Proving Modulo Based on Boolean Equational Procedures -- Rectangles, Fringes, and Inverses -- An Ordered Category of Processes -- Automatic Proof Generation in Kleene Algebra.
650 0 _aMachine theory.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSoftware Engineering.
700 1 _aBerghammer, Rudolf.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMöller, Bernhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aStruth, Georg.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540789123
776 0 8 _iPrinted edition:
_z9783540849582
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4988
856 4 0 _uhttps://doi.org/10.1007/978-3-540-78913-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c184133
_d184133