Relations and Kleene Algebra in Computer Science 10th 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 /
Relations and Kleene Algebra in Computer Science 10th 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 / [electronic resource] :
edited by Rudolf Berghammer, Bernhard Möller, Georg Struth.
- 1st ed. 2008.
- X, 402 p. online resource.
- Theoretical Computer Science and General Issues, 4988 2512-2029 ; .
- Theoretical Computer Science and General Issues, 4988 .
Formal 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.
9783540789130
10.1007/978-3-540-78913-0 doi
Machine theory.
Computer science--Mathematics.
Artificial intelligence.
Software engineering.
Formal Languages and Automata Theory.
Symbolic and Algebraic Manipulation.
Artificial Intelligence.
Software Engineering.
QA267-268.5
005.131
Formal 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.
9783540789130
10.1007/978-3-540-78913-0 doi
Machine theory.
Computer science--Mathematics.
Artificial intelligence.
Software engineering.
Formal Languages and Automata Theory.
Symbolic and Algebraic Manipulation.
Artificial Intelligence.
Software Engineering.
QA267-268.5
005.131