找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic-Based Program Synthesis and Transformation; 9th International Wo Annalisa Bossi Conference proceedings 2000 Springer-Verlag Berlin He

[复制链接]
查看: 33911|回复: 60
发表于 2025-3-21 16:18:45 | 显示全部楼层 |阅读模式
书目名称Logic-Based Program Synthesis and Transformation
副标题9th International Wo
编辑Annalisa Bossi
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Logic-Based Program Synthesis and Transformation; 9th International Wo Annalisa Bossi Conference proceedings 2000 Springer-Verlag Berlin He
描述This volume contains the proceedings of the ninth international workshop on logic-based program synthesis and transformation (LOPSTR’99) which was held in Venice (Italy), September 22-24, 1999. LOPSTRistheannualworkshopandforumforresearchersinthelogic-based program development stream of computational logic. The main focus used to be on synthesis and transformation of logic programs, but the workshop is open to contributions on logic-based program development in any paradigm. Previous workshops were held in Manchester, UK (1991, 1992), Louvain-la-Neuve, B- gium (1993), Pisa, Italy (1994), Arnhem, The Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), and Manchester, UK (1998). LOPSTR is a real workshop in the sense that it is a friendly and lively forum for presenting recent and current research as well as discussing future trends. Formal proceedings of the workshop are produced only after the workshop and contain only those papers selected by the program committee after a second refereeing process. The program committee of LOPSTR’99 accepted 20 extended abstracts for presentation at the workshop; then selected 14 papers for inclusion in the po- workshop proceedin
出版日期Conference proceedings 2000
关键词Computational Logic; Constraint Programming; Debugging; Extension; Formal Methods Program Verification; F
版次1
doihttps://doi.org/10.1007/10720327
isbn_softcover978-3-540-67628-7
isbn_ebook978-3-540-45148-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

书目名称Logic-Based Program Synthesis and Transformation影响因子(影响力)




书目名称Logic-Based Program Synthesis and Transformation影响因子(影响力)学科排名




书目名称Logic-Based Program Synthesis and Transformation网络公开度




书目名称Logic-Based Program Synthesis and Transformation网络公开度学科排名




书目名称Logic-Based Program Synthesis and Transformation被引频次




书目名称Logic-Based Program Synthesis and Transformation被引频次学科排名




书目名称Logic-Based Program Synthesis and Transformation年度引用




书目名称Logic-Based Program Synthesis and Transformation年度引用学科排名




书目名称Logic-Based Program Synthesis and Transformation读者反馈




书目名称Logic-Based Program Synthesis and Transformation读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:32:35 | 显示全部楼层
发表于 2025-3-22 03:48:18 | 显示全部楼层
发表于 2025-3-22 05:10:59 | 显示全部楼层
发表于 2025-3-22 11:02:40 | 显示全部楼层
发表于 2025-3-22 16:16:10 | 显示全部楼层
Specialising Finite Domain Programs Using Polyhedradividual finite domain constraints are over-approximated by polyhedra to describe the solution space over . integer variables as an . dimensional polyhedron. This polyhedron is then approximated, using projection, as an . dimensional bounding box that can be used to specialise and improve the domain
发表于 2025-3-22 19:43:17 | 显示全部楼层
发表于 2025-3-22 22:20:54 | 显示全部楼层
Transformation of Left Terminating Programsxtends our previous proposal in [BCE95] by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode inform
发表于 2025-3-23 03:47:42 | 显示全部楼层
发表于 2025-3-23 07:17:21 | 显示全部楼层
Making Mercury Programs Tail Recursiveing them before the recursive call, modifying them as necessary. The first optimization moves calls to associative predicates; it is a pure source to source transformation. The second optimization moves construction unifications; it required extensions to the mode system (to record aliases) and to t
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-7 13:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表