检索结果-内蒙古大学图书馆

17th international conference on relational and algebraic methods in computer science, ramics 2018

ISBN: (纸本)9783030021481

the proceedings contain 22 papers. the special focus in this conference is on relational and algebraic methods in computer science. the topics include: Counting finite linearly ordered involutive bisemilattices;MIX * -autonomous quantales and the continuous weak order;calculational verification of reactive programs with reactive relations and Kleene algebra;verifying hybrid systems with modal Kleene algebra;algebraic derivation of until rules and application to timer verification;false failure: Creating failure models for separation logic;Towards an analysis of dynamic gossip in NetKAT;coalgebraic tools for randomness-conserving protocols;algebraic solution of weighted minimax single-facility constrained location problems;C-dioids and μ-continuous Chomsky-algebras;a set solver for finite set relation algebra;on the computational complexity of non-dictatorial aggregation;Calculational relation-algebraic proofs in the teaching tool CALCCHECK;coequalizers and tensor products for continuous idempotent semirings;distances, norms and error propagation in idempotent semirings;t-norm based operations in arrow categories;decidability of equational theories for subsignatures of relation algebra;composition of different-type relations via the Kleisli category for the continuation monad;axiomatizing discrete spatial relations;a modal and relevance logic for qualitative spatial reasoning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

20th international conference on relational and algebraic methods in computer science, ramics 2023

20th International Conference on Relational and Algebraic Me...

引用

20th international conference on relational and algebraic methods in computer science, ramics 2023

ISBN: (纸本)9783031280825

the proceedings contain 17 papers. the special focus in this conference is on relational and algebraic methods in computer science. the topics include: What Else is Undecidable About Loops?;implication Algebras and Implication Semigroups of Binary Relations;on the Complexity of Kleene Algebra with Domain;enumerating, Cataloguing and Classifying All Quantales on up to Nine Elements;duoidally Enriched Freyd Categories;towards a theory of Conversion Relations for Prefixed Units of Measure;relational algebraic Approach to the Real Numbers the Additive Group;comer Schemes, Relation Algebras, and the Flexible Atom Conjecture;a General Method for Representing Sets of Relations by Vectors;contextuality in Distributed Systems;the Structure of Locally Integral Involutive Po-monoids and Semirings;compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients;dependences Between Domain Constructions in Heterogeneous Relation Algebras;normal Forms for Elements of the -continuous Kleene Algebras (formula presented);representable and Diagonally Representable Weakening Relation Algebras.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Verifying minimum spanning tree algorithms with Stone relation algebras

引用

JOURNAL OF LOGICAL AND algebraic methods IN PROGRAMMING 2018年 101卷 132-150页

作者： Guttmann, Walter Univ Canterbury Dept Comp Sci & Software Engn Christchurch New Zealand

We study a generalisation of relation algebras in which the underlying Boolean algebra structure is replaced with a Stone algebra. Many theorems of relation algebras generalise with no or small changes. Weighted graphs represented as matrices over extended real numbers form an instance. relational concepts and methods can thus be applied to weighted graphs. We formally specify the problem of computing minimum spanning forests and express Kruskal's algorithm in relation-algebraic terms. We give a total correctness proof of the algorithm. All results are formally verified in Isabelle/HOL. this paper is an extended version of [40]. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Formal methods Kleene algebras Relation algebras Stone algebras Total correctness Weighted graphs

来源：评论

学校读者我要写书评

暂无评论

Calculational Verification of Reactive Programs with Reactive Relations and Kleene Algebra 17th

Calculational Verification of Reactive Programs with Reactiv...

引用

17th international conference on relational and algebraic methods in computer science (ramics)

作者： Foster, Simon Ye, Kangfeng Cavalcanti, Ana Woodcock, Jim Univ York York N Yorkshire England

ISBN: (纸本)9783030021498;9783030021481

Reactive programs are ubiquitous in modern applications, and so verification is highly desirable. We present a verification strategy for reactive programs with a large or infinite state space utilising algebraic laws for reactive relations. We define novel operators to characterise interactions and state updates, and an associated equational theory. With this we can calculate a reactive program's denotational semantics, and thereby facilitate automated proof. Of note is our reasoning support for iterative programs with reactive invariants, which is supported by Kleene algebra. We illustrate our strategy by verifying a reactive buffer. Our laws and strategy are mechanised in Isabelle/UTP, which provides soundness guarantees, and practical verification support.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

17th international conference on Intelligent Text Processing and Computational Linguistics, CICLing 2016

17th International Conference on Intelligent Text Processing...

引用

17th international conference on Intelligent Text Processing and Computational Linguistics, CICLing 2016

ISBN: (纸本)9783319754765

the proceedings contain 94 papers. the special focus in this conference is on . the topics include: Mining the web for collocations: IR models of term associations;a continuum-based model of lexical acquisition;description of Turkish paraphrase corpus structure and generation method;extracting terminological relationships from historical patterns of social media terms;adaptation of cross-lingual transfer methods for the building of medical terminology in Ukrainian;adaptation of a term extractor to arabic specialised texts: First experiments and limits;corpus frequency and affix ordering in Turkish;pluralising nouns in isiZulu and related languages;morphological analysis of urdu verbs;a roadmap towards machine intelligence;stemming and segmentation for classical Tibetan;part of speech tagging for Polish: State of the art and future perspectives;turkish PoS tagging by reducing sparsity with morpheme tags in small datasets;part-of-Speech Tagging for code mixed English-Telugu social media data;analysis of word order in multiple treebanks;a framework for language resource construction and syntactic analysis: Case of Arabic;enhancing neural network based dependency parsing using morphological information for Hindi;construction grammar based annotation framework for parsing Tamil;comparative error analysis of parser outputs on Telugu Dependency Treebank;gut, Besser, Chunker – Selecting the best models for text chunking with voting;algebraic specification for interoperability between data formats: Application on Arabic Lexical Data;a deep learning solution to named entity recognition;deep learning approach for arabic named entity recognition;hybrid feature selection approach for arabic named entity recognition;Named-Entity-Recognition (NER) for tamil language using Margin-Infused Relaxed Algorithm (MIRA).

关键词：

来源：评论

学校读者我要写书评

暂无评论

17th international conference on Intelligent Text Processing and Computational Linguistics, CICLing 2016

17th International Conference on Intelligent Text Processing...

引用

17th international conference on Intelligent Text Processing and Computational Linguistics, CICLing 2016

ISBN: (纸本)9783319754864

关键词：

来源：评论

学校读者我要写书评

暂无评论

Relation algebras, matrices, and multi-valued decision diagrams

Relation algebras, matrices, and multi-valued decision diagr...

引用

13th international conference on relational and algebraic methods in computer science, ramics 2012

作者： Atampore, Francis Winter, Michael Department of Computer Science Brock University St. Catharines ON Canada

ISBN: (纸本)9783642333132

In this paper we want to further investigate the usage of matrices as a representation of relations within arbitrary heterogeneous relation algebras. First, we want to show that splittings do exist in matrix algebras assuming that the underlying algebra of the coefficients provides this operation. Second, we want to outline an implementation of matrix algebras using reduced ordered multi-valued decision diagrams. this implementation combines the efficiency of operations based on those data structures with the general matrix approach to arbitrary relation algebras. © 2012 Springer-Verlag.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：