找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Relational and Kleene-Algebraic Methods in Computer Science; 7th International Se Rudolf Berghammer,Bernhard Möller,Georg Struth Conference

[复制链接]
查看: 50623|回复: 61
发表于 2025-3-21 19:48:40 | 显示全部楼层 |阅读模式
书目名称Relational and Kleene-Algebraic Methods in Computer Science
副标题7th International Se
编辑Rudolf Berghammer,Bernhard Möller,Georg Struth
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Relational and Kleene-Algebraic Methods in Computer Science; 7th International Se Rudolf Berghammer,Bernhard Möller,Georg Struth Conference
出版日期Conference proceedings 2004
关键词Attribut; Processing; action algebra; algorithms; calculus; database; formal languages; formal methods; mode
版次1
doihttps://doi.org/10.1007/b98117
isbn_softcover978-3-540-22145-6
isbn_ebook978-3-540-24771-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2004
The information of publication is updating

书目名称Relational and Kleene-Algebraic Methods in Computer Science影响因子(影响力)




书目名称Relational and Kleene-Algebraic Methods in Computer Science影响因子(影响力)学科排名




书目名称Relational and Kleene-Algebraic Methods in Computer Science网络公开度




书目名称Relational and Kleene-Algebraic Methods in Computer Science网络公开度学科排名




书目名称Relational and Kleene-Algebraic Methods in Computer Science被引频次




书目名称Relational and Kleene-Algebraic Methods in Computer Science被引频次学科排名




书目名称Relational and Kleene-Algebraic Methods in Computer Science年度引用




书目名称Relational and Kleene-Algebraic Methods in Computer Science年度引用学科排名




书目名称Relational and Kleene-Algebraic Methods in Computer Science读者反馈




书目名称Relational and Kleene-Algebraic Methods in Computer Science读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:20:29 | 显示全部楼层
Fixed-Point Characterisation of Winning Strategies in Impartial GamesWe use fixed-point calculus to characterise winning strategies in impartial, two-person games. A byproduct is the fixed-point characterisation of winning, losing and stalemate positions. We expect the results to be most useful in teaching calculational reasoning about least and greatest fixed points.
发表于 2025-3-22 03:24:00 | 显示全部楼层
发表于 2025-3-22 05:29:05 | 显示全部楼层
发表于 2025-3-22 12:17:58 | 显示全部楼层
Calculational Relation-Algebraic Proofs in Isabelle/IsarWe propose a collection of theories in the proof assistant Isabelle/Isar that support calculational reasoning in and about heterogeneous relational algebras and Kleene algebras.
发表于 2025-3-22 16:10:30 | 显示全部楼层
A Calculus of Typed RelationsA calculus of typed relations subsuming the classical relational database theory is presented. An associated sound and complete deduction mechanism is developed. The formulation is generalized to deal with nondeterministic databases and information relations in the rough set-style.
发表于 2025-3-22 17:11:54 | 显示全部楼层
978-3-540-22145-6Springer-Verlag Berlin Heidelberg 2004
发表于 2025-3-22 22:16:38 | 显示全部楼层
Relational and Kleene-Algebraic Methods in Computer Science978-3-540-24771-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-23 01:28:01 | 显示全部楼层
发表于 2025-3-23 09:09:04 | 显示全部楼层
Towards a Formalisation of Relational Database Theory in Constructive Type Theoryh successive formalisation is of more generality, and correspondingly more complex, than the previous one. All our work is carried out in the proof editor Alfa for Martin-Löf’s monomorphic type theory. Our goal is to obtain a formalisation that provides us with computational content, instead of just being a completely abstract theory.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-11 05:30
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表