國立虎尾科技大學 |

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, Mai Gehrke, Luigi Santocanale, Michael Winter.
其他題名:	19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings /
其他作者:	Fahrenberg, Uli.
面頁冊數:	XVII, 499 p. 129 illus., 54 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Logic programming. -
電子資源:	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] :edited by Uli Fahrenberg, Mai Gehrke, Luigi Santocanale, Michael Winter. - 1st ed. 2021. - XVII, 499 p. 129 illus., 54 illus. in color.online resource. - Theoretical Computer Science and General Issues,130272512-2029 ;. - Theoretical Computer Science and General Issues,12865.

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:

670217
Logic programming.

LC Class. No.: QA76.63

Dewey Class. No.: 005.115

Relational and Algebraic Methods in Computer Science = 19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings /
LDR:03923nam a22004095i 4500 001 1059401
003 DE-He213
005 20220223104438.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030887018 $9 978-3-030-88701-8
024 7 $a 10.1007/978-3-030-88701-8 $2 doi
035 $a 978-3-030-88701-8
050 4 $a QA76.63
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 005.115 $2 23
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, Mai Gehrke, Luigi Santocanale, Michael Winter.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVII, 499 p. 129 illus., 54 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $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 Logic programming. $3 670217
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer science. $3 573171
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Logic in AI. $3 1228083
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Mathematical Logic and Foundations. $3 669393
700 1 $a Fahrenberg, Uli. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 815868
700 1 $a Gehrke, Mai. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361847
700 1 $a Santocanale, Luigi. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361848
700 1 $a Winter, Michael. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 887881
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030887001
776 0 8 $i Printed edition: $z 9783030887025
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-88701-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)