단행본 상세

서지주요정보
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 Science [electronic resource] : 19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings / edited by Uli Fahrenberg, Mai Gehrke, Luigi Santocanale, Michael Winter.
저자명 Fahrenberg, Uli. editor. edt http://id.loc.gov/vocabulary/relators/edt ; Gehrke, Mai. editor. edt http://id.loc.gov/vocabulary/relators/edt ; Santocanale, Luigi. editor. edt http://id.loc.gov/vocabulary/relators/edt ; Winter, Michael. editor. edt http://id.loc.gov/vocabulary/relators/edt
단체명 SpringerLink (Online service)
판사항 1st ed. 2021.
발행사항 Cham : Springer International Publishing : Imprint: Springer, 2021.
총서명 Theoretical Computer Science and General Issues, 2512-2029 ; 13027
Online Access https://doi.org/10.1007/978-3-... URL

서지기타정보

서지기타정보
ISBN 9783030887018
기타 표준번호 10.1007/978-3-030-88701-8
청구기호 QA76.63
형태사항 XVII, 499 p. 129 illus., 54 illus. in color. online resource.
언어 English
내용 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.
주제 Logic programming.
Computer science --Mathematics.
Computer science.
Mathematical logic.
Logic in AI.
Mathematics of Computing.
Theory of Computation.
Mathematical Logic and Foundations.
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9783030887001 Printed edition: 9783030887025
QR CODE