找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 34051|回復(fù): 60
樓主
發(fā)表于 2025-3-21 16:18:45 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Logic-Based Program Synthesis and Transformation
副標(biāo)題9th International Wo
編輯Annalisa Bossi
視頻videohttp://file.papertrans.cn/589/588100/588100.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度




書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation被引頻次




書目名稱Logic-Based Program Synthesis and Transformation被引頻次學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation年度引用




書目名稱Logic-Based Program Synthesis and Transformation年度引用學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation讀者反饋




書目名稱Logic-Based Program Synthesis and Transformation讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:32:35 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:48:18 | 只看該作者
地板
發(fā)表于 2025-3-22 05:10:59 | 只看該作者
5#
發(fā)表于 2025-3-22 11:02:40 | 只看該作者
6#
發(fā)表于 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
7#
發(fā)表于 2025-3-22 19:43:17 | 只看該作者
8#
發(fā)表于 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
9#
發(fā)表于 2025-3-23 03:47:42 | 只看該作者
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 23:27
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
贺州市| 吉木萨尔县| 乌鲁木齐县| 华亭县| 浦城县| 新密市| 峡江县| 喀什市| 达拉特旗| 衡水市| 宁陕县| 武安市| 青龙| 衡水市| 忻州市| 双城市| 晋中市| 承德县| 巨鹿县| 东乌| 南宁市| 凭祥市| 吉水县| 论坛| 沐川县| 溧阳市| 聂荣县| 炎陵县| 延吉市| 包头市| 拉萨市| 鸡泽县| 大余县| 酒泉市| 修水县| 平果县| 托里县| 武乡县| 旌德县| 海口市| 峨眉山市|