找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Constraints Meet Concurrency; Jacopo Mauro Book 2014 Atlantis Press and the authors 2014 Concurrency theory.Constraint Handling Rules.Cons

[复制链接]
查看: 39632|回复: 50
发表于 2025-3-21 17:43:33 | 显示全部楼层 |阅读模式
书目名称Constraints Meet Concurrency
编辑Jacopo Mauro
视频video
概述A new approach to combine constraint programming and concurrency theory.Best 2012 doctoral dissertation in theoretical computer science and logic by Italian EATCS chapter.Best 2012 doctoral dissertati
丛书名称Atlantis Studies in Computing
图书封面Titlebook: Constraints Meet Concurrency;  Jacopo Mauro Book 2014 Atlantis Press and the authors 2014 Concurrency theory.Constraint Handling Rules.Cons
描述This book describes the benefits that emerge when the fields of constraint programming and concurrency meet. On the one hand, constraints can be used in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a pragmatic point of view. On the other hand, problems modeled by using constraints can be solved faster and more efficiently using a concurrent system. Both directions are explored providing two separate lines of development. Firstly the expressive power of a concurrent language is studied, namely Constraint Handling Rules, that supports constraints as a primitive construct. The features of this language which make it Turing powerful are shown. Then a framework is proposed to solve constraint problems that is intended to be deployed on a concurrent system. For the development of this framework the concurrent language Jolie following the Service Oriented paradigm is used. Based on this experience, an extension to Service Oriented Languages is also proposed in order to overcome some of their limitations and to improve the development of concurrent applications.
出版日期Book 2014
关键词Concurrency theory; Constraint Handling Rules; Constraint programming; Service oriented computing
版次1
doihttps://doi.org/10.2991/978-94-6239-067-6
isbn_ebook978-94-6239-067-6Series ISSN 2212-8557 Series E-ISSN 2212-8565
issn_series 2212-8557
copyrightAtlantis Press and the authors 2014
The information of publication is updating

书目名称Constraints Meet Concurrency影响因子(影响力)




书目名称Constraints Meet Concurrency影响因子(影响力)学科排名




书目名称Constraints Meet Concurrency网络公开度




书目名称Constraints Meet Concurrency网络公开度学科排名




书目名称Constraints Meet Concurrency被引频次




书目名称Constraints Meet Concurrency被引频次学科排名




书目名称Constraints Meet Concurrency年度引用




书目名称Constraints Meet Concurrency年度引用学科排名




书目名称Constraints Meet Concurrency读者反馈




书目名称Constraints Meet Concurrency读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:31:07 | 显示全部楼层
Constraints Meet Concurrency978-94-6239-067-6Series ISSN 2212-8557 Series E-ISSN 2212-8565
发表于 2025-3-22 02:07:16 | 显示全部楼层
发表于 2025-3-22 05:17:16 | 显示全部楼层
发表于 2025-3-22 10:01:25 | 显示全部楼层
发表于 2025-3-22 16:18:54 | 显示全部楼层
发表于 2025-3-22 21:02:40 | 显示全部楼层
https://doi.org/10.1007/978-3-319-39448-0A constraint is something that restricts, limits, or regulates. From this notion of constraint, a new field of computer science has been created: Constraint Programming (CP).
发表于 2025-3-22 21:33:30 | 显示全部楼层
Ton J. Cleophas,Aeilko H. ZwindermanConcurrency in computer science is a property of systems in which more than one execution context can be active at the same time.
发表于 2025-3-23 05:03:44 | 显示全部楼层
https://doi.org/10.1007/978-3-319-39614-9The idea of approaching hard combinatorial optimization problems through a combination of search and constraint solving appeared first in logic programming. Despite the continued support of logic programming for constraint programmers, research efforts were initiated to import constraint technologies into other paradigms.
发表于 2025-3-23 06:43:35 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-4 15:23
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表