東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Relational and algebraic methods in ...

RAMiCS (Conference) (2021 :)

FindBook

Google Book

Amazon

博客來

Relational and algebraic methods in computer science = 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Relational and algebraic methods in computer science/ edited by Uli Fahrenberg ... [et al.].
其他題名:	19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021 : proceedings /
其他題名:	RAMiCS 2021
其他作者:	Fahrenberg, Uli.
團體作者:	RAMiCS (Conference)
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xvii, 499 p. :ill. (some col.), digital ;24 cm.
內容註:	Unary-determined distributive l-magmas and bunched implication algebras -- Effect Algebras, Girard Quantales and Complementation in Separation Logic -- Relational Computation of Sets of Relations -- Experimental Investigation of Su cient Criteria for Relations to Have Kernels -- lr-Multisemigroups, Modal Quantales and the Origin of Locality -- Abstract Strategies and Coherence -- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm PEARL -- The class of representable semilattice-ordered monoids is not a variety -- Accretive Computation of Global Transformations -- Some modal and temporal translations of generalized basic logic -- Isolated Sublattices and their Application to Counting Closure Operators -- Second-Order Properties of Undirected Graphs -- Relation-algebraic Verification of Bor uvka's Minimum Spanning Tree Algorithm -- Deciding FO-definability of Regular Languages -- Relational Models for the Lambek calculus with Intersection and Unit -- Free Modal Riesz Spaces are Archimedean: a Syntactic Proof -- Polyadic spaces and profinite monoids -- Time Warps, from Algebra to Algorithms -- On Algebra of Program Correctness and Incorrectness -- Computing Least and Greatest Fixed Points in Absorptive Semirings -- A Variety Theorem for Relational Universal Algebra. -On Tools for Completeness of Kleene Algebra with Hypotheses. -Skew metrics valued in Sugihara semigroups -- Computing Aggregated Knowledge as the Greatest Lower Bound of Knowledge -- Relational Sums and Splittings in Categories of L-fuzzy Relations -- Change of Base using Arrow Categories -- Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving -- Domain Range Semigroups and Finite Representations.
Contained By:	Springer Nature eBook
標題:	Computer science - Mathematics -
電子資源:	https://doi.org/10.1007/978-3-030-88701-8
ISBN:	9783030887018

Relational and algebraic methods in computer science = 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021 : proceedings /
Relational and algebraic methods in computer science19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021 : proceedings /[electronic resource] :RAMiCS 2021edited by Uli Fahrenberg ... [et al.]. - Cham :Springer International Publishing :2021. - xvii, 499 p. :ill. (some col.), digital ;24 cm. - Theoretical computer science and general issues ;13027. - Theoretical computer science and general issues ;13027..

Unary-determined distributive l-magmas and bunched implication algebras -- Effect Algebras, Girard Quantales and Complementation in Separation Logic -- Relational Computation of Sets of Relations -- Experimental Investigation of Su cient Criteria for Relations to Have Kernels -- lr-Multisemigroups, Modal Quantales and the Origin of Locality -- Abstract Strategies and Coherence -- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm PEARL -- The class of representable semilattice-ordered monoids is not a variety -- Accretive Computation of Global Transformations -- Some modal and temporal translations of generalized basic logic -- Isolated Sublattices and their Application to Counting Closure Operators -- Second-Order Properties of Undirected Graphs -- Relation-algebraic Verification of Bor uvka's Minimum Spanning Tree Algorithm -- Deciding FO-definability of Regular Languages -- Relational Models for the Lambek calculus with Intersection and Unit -- Free Modal Riesz Spaces are Archimedean: a Syntactic Proof -- Polyadic spaces and profinite monoids -- Time Warps, from Algebra to Algorithms -- On Algebra of Program Correctness and Incorrectness -- Computing Least and Greatest Fixed Points in Absorptive Semirings -- A Variety Theorem for Relational Universal Algebra. -On Tools for Completeness of Kleene Algebra with Hypotheses. -Skew metrics valued in Sugihara semigroups -- Computing Aggregated Knowledge as the Greatest Lower Bound of Knowledge -- Relational Sums and Splittings in Categories of L-fuzzy Relations -- Change of Base using Arrow Categories -- Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving -- Domain Range Semigroups and Finite Representations.

This book constitutes the proceedings of the 19th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2021, which took place in Marseille, France, during November 2-5, 2021. The 29 papers presented in this book were carefully reviewed and selected from 35 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.

ISBN: 9783030887018

Standard No.: 10.1007/978-3-030-88701-8doiSubjects--Topical Terms:

678603
Computer science
--Mathematics

LC Class. No.: QA76.9.M35 / R35 2021

Dewey Class. No.: 004.0151

Relational and algebraic methods in computer science = 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021 : proceedings /
LDR:03582nmm a2200349 a 4500 001 2253771
003 DE-He213
005 20211012162132.0
006 m d
007 cr nn 008maaau
008 220327s2021 sz s 0 eng d
020 $a 9783030887018 $q (electronic bk.)
020 $a 9783030887001 $q (paper)
024 7 $a 10.1007/978-3-030-88701-8 $2 doi
035 $a 978-3-030-88701-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b R35 2021
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b R382 2021
111 2 $a RAMiCS (Conference) $n (19th : $d 2021 : $c Marseille, France) $3 3522305
245 1 0 $a Relational and algebraic methods in computer science $h [electronic resource] : $b 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021 : proceedings / $c edited by Uli Fahrenberg ... [et al.].
246 3 $a RAMiCS 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xvii, 499 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Theoretical computer science and general issues ; $v 13027
505 0 $a Unary-determined distributive l-magmas and bunched implication algebras -- Effect Algebras, Girard Quantales and Complementation in Separation Logic -- Relational Computation of Sets of Relations -- Experimental Investigation of Su cient Criteria for Relations to Have Kernels -- lr-Multisemigroups, Modal Quantales and the Origin of Locality -- Abstract Strategies and Coherence -- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm PEARL -- The class of representable semilattice-ordered monoids is not a variety -- Accretive Computation of Global Transformations -- Some modal and temporal translations of generalized basic logic -- Isolated Sublattices and their Application to Counting Closure Operators -- Second-Order Properties of Undirected Graphs -- Relation-algebraic Verification of Bor uvka's Minimum Spanning Tree Algorithm -- Deciding FO-definability of Regular Languages -- Relational Models for the Lambek calculus with Intersection and Unit -- Free Modal Riesz Spaces are Archimedean: a Syntactic Proof -- Polyadic spaces and profinite monoids -- Time Warps, from Algebra to Algorithms -- On Algebra of Program Correctness and Incorrectness -- Computing Least and Greatest Fixed Points in Absorptive Semirings -- A Variety Theorem for Relational Universal Algebra. -On Tools for Completeness of Kleene Algebra with Hypotheses. -Skew metrics valued in Sugihara semigroups -- Computing Aggregated Knowledge as the Greatest Lower Bound of Knowledge -- Relational Sums and Splittings in Categories of L-fuzzy Relations -- Change of Base using Arrow Categories -- Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving -- Domain Range Semigroups and Finite Representations.
520 $a This book constitutes the proceedings of the 19th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2021, which took place in Marseille, France, during November 2-5, 2021. The 29 papers presented in this book were carefully reviewed and selected from 35 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.
650 0 $a Computer science $x Mathematics $x Congresses. $3 678603
650 0 $a Algebraic logic $v Congresses. $3 844579
650 0 $a Relation algebras $v Congresses. $3 844580
650 1 4 $a Logic in AI. $3 3386372
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Mathematical Logic and Foundations. $3 892656
700 1 $a Fahrenberg, Uli. $3 3449668
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Theoretical computer science and general issues ; $v 13027. $3 3522306
856 4 0 $u https://doi.org/10.1007/978-3-030-88701-8
950 $a Mathematics and Statistics (SpringerNature-11649)