標(biāo)題: Titlebook: Logic-Based Program Synthesis and Transformation; 9th International Wo Annalisa Bossi Conference proceedings 2000 Springer-Verlag Berlin He [打印本頁] 作者: IU421 時(shí)間: 2025-3-21 16:18
書目名稱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é)科排名
作者: Axillary 時(shí)間: 2025-3-21 21:32 作者: eulogize 時(shí)間: 2025-3-22 03:48 作者: 厚顏 時(shí)間: 2025-3-22 05:10 作者: 使閉塞 時(shí)間: 2025-3-22 11:02 作者: AGONY 時(shí)間: 2025-3-22 16:16
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作者: installment 時(shí)間: 2025-3-22 19:43 作者: Blemish 時(shí)間: 2025-3-22 22:20
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作者: HEAVY 時(shí)間: 2025-3-23 03:47 作者: TEM 時(shí)間: 2025-3-23 07:17
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作者: periodontitis 時(shí)間: 2025-3-23 10:18 作者: hermitage 時(shí)間: 2025-3-23 17:15 作者: 鬼魂 時(shí)間: 2025-3-23 20:47 作者: 蚊帳 時(shí)間: 2025-3-24 02:11 作者: opportune 時(shí)間: 2025-3-24 05:49 作者: SPALL 時(shí)間: 2025-3-24 10:13 作者: 直言不諱 時(shí)間: 2025-3-24 14:33 作者: Inflated 時(shí)間: 2025-3-24 17:23
Jan-Georg Smaus,Patricia M. Hill,Andy Kingnce on Machine Learning (LNAI 2837) and the Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (LNAI 2838). The two conferences were held on September 22–26, 2003 in Cavtat, a small tourist town in the vicinity of Dubrovnik, Croatia. As machine 作者: Foolproof 時(shí)間: 2025-3-24 22:47 作者: Ethics 時(shí)間: 2025-3-25 01:57
Jacob M. Howe,Andy Kingere jointly organized this year for the ?fth time in a row, after some years of mutual independence before. After Freiburg (2001), Helsinki (2002), Cavtat (2003) and Pisa (2004), Porto received the 16th edition of ECML and the 9th PKDD in October 3–7. Having the two conferences together seems to be 作者: expeditious 時(shí)間: 2025-3-25 03:34 作者: 維持 時(shí)間: 2025-3-25 11:28 作者: paroxysm 時(shí)間: 2025-3-25 15:31
Alberto Pettorossi,Maurizio Proiettia tool to drive the discovery process towards potentially . patterns, with the positive side effect of achieving a more efficient computation. So far the research on this paradigm has mainly focussed on the latter aspect: the development of efficient algorithms for the evaluation of constraint-based作者: perimenopause 時(shí)間: 2025-3-25 19:32
Peter Ross,David Overton,Zoltan Somogyia tool to drive the discovery process towards potentially . patterns, with the positive side effect of achieving a more efficient computation. So far the research on this paradigm has mainly focussed on the latter aspect: the development of efficient algorithms for the evaluation of constraint-based作者: 全等 時(shí)間: 2025-3-25 23:34 作者: 祖?zhèn)髫?cái)產(chǎn) 時(shí)間: 2025-3-26 04:14
Marija Kula?to build powerful classifiers and to help establishing diagnosis. Because of the huge search space, mining and representing EPs is a hard and complex task for large datasets. Thanks to the use of recent results on condensed representations of frequent closed patterns, we propose here an . condensed 作者: 上釉彩 時(shí)間: 2025-3-26 04:59 作者: 消音器 時(shí)間: 2025-3-26 11:18 作者: 改變立場(chǎng) 時(shí)間: 2025-3-26 14:55
Jürgen Gieslnames in natural language text is a named entity recognition (NER) task. Previous studies focus on combining abundant human made rules, trigger words, to enhance the system performance. However these methods require domain experts to build up these rules and word set which relies on lots of human ef作者: Agronomy 時(shí)間: 2025-3-26 19:32
med entities and their relationships, especially protein names and protein-protein interactions. We are adopting methods including natural language processing, machine learning, and text processing. But we are not developing a new tagging or parsing technique. Developing a new tagger or a new parser作者: Madrigal 時(shí)間: 2025-3-26 22:31
Annalisa BossiIncludes supplementary material: 作者: GRIPE 時(shí)間: 2025-3-27 05:11 作者: Peristalsis 時(shí)間: 2025-3-27 06:19 作者: AMOR 時(shí)間: 2025-3-27 13:18 作者: ABIDE 時(shí)間: 2025-3-27 15:10
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 information.作者: AND 時(shí)間: 2025-3-27 18:51 作者: Foreshadow 時(shí)間: 2025-3-27 22:09
Algebraic Specification and Program Development by Stepwise RefinementVarious formalizations of the concept of “refinement step” as used in the formal development of programs from algebraic specifications are presented and compared.作者: FLAGR 時(shí)間: 2025-3-28 02:27 作者: hardheaded 時(shí)間: 2025-3-28 06:20
https://doi.org/10.1007/10720327Computational Logic; Constraint Programming; Debugging; Extension; Formal Methods Program Verification; F作者: STELL 時(shí)間: 2025-3-28 11:50 作者: 賠償 時(shí)間: 2025-3-28 17:39
Logic-Based Program Synthesis and Transformation978-3-540-45148-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 剝皮 時(shí)間: 2025-3-28 18:59 作者: 漫步 時(shí)間: 2025-3-29 02:35
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programsecking at run-time those assertions whose status cannot be determined at compile-time. Both the static and the dynamic checking are provably safe in the sense that all errors flagged are definite violations of the specifications. Finally, we report briefly on the currently implemented instances of t作者: 魔鬼在游行 時(shí)間: 2025-3-29 04:53 作者: 大門在匯總 時(shí)間: 2025-3-29 07:30 作者: Ostrich 時(shí)間: 2025-3-29 12:38
0302-9743 econd 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 proceedin978-3-540-67628-7978-3-540-45148-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 劇毒 時(shí)間: 2025-3-29 17:17
Juliana Küster Filipe,Kung-Kiu Lau,Mario Ornaghi,Hirokazu Yatsu作者: 黃瓜 時(shí)間: 2025-3-29 23:21
can effectively be exploited to rewrite a user query into another one such that the new query provides equally meaningful results that satisfy the intention of the user. Based on practical examples and their usefulness we develop a set of rewriting rules. In addition, we prove that the results of th作者: Neonatal 時(shí)間: 2025-3-30 01:38 作者: Condescending 時(shí)間: 2025-3-30 05:58
Julio C. Peralta,John P. Gallagherlgorithm that extends the support-confidence framework with a sliding correlation coefficient threshold. In addition to finding confident positive rules that have a strong correlation, the algorithm discovers negative association rules with strong negative correlation between the antecedents and con作者: 的闡明 時(shí)間: 2025-3-30 09:11
Jacob M. Howe,Andy Kingmanaged to have 3 highly qua- ?edindependentreviewsperpaper(withveryfewexceptions)andoneadditional overall input from one of the Area Chairs. After the authors’ responses and the online discussions for many of the papers, we arrived at the ?nal selection of 40 regular papers for ECML and 35 for PKDD作者: Asparagus 時(shí)間: 2025-3-30 12:27 作者: SHOCK 時(shí)間: 2025-3-30 17:29 作者: expository 時(shí)間: 2025-3-30 21:20
Alberto Pettorossi,Maurizio Proietti introduced the new paradigm of pattern discovery based on ., and instantiated our idea to the fuzzy soft constraints. In this paper we extend the framework to deal with probabilistic and weighted soft constraints: we provide theoretical basis and detailed experimental analysis. We also discuss a st作者: affluent 時(shí)間: 2025-3-31 04:03
Peter Ross,David Overton,Zoltan Somogyi introduced the new paradigm of pattern discovery based on ., and instantiated our idea to the fuzzy soft constraints. In this paper we extend the framework to deal with probabilistic and weighted soft constraints: we provide theoretical basis and detailed experimental analysis. We also discuss a st作者: 半身雕像 時(shí)間: 2025-3-31 06:22
Marco Bertolino,Sandro Etalle,Catuscia Palamidessittern is in the collection. Furthermore, the encoding of the interestingness values reflects our understanding of the pattern collection. Thus the size of the encoding can be used to evaluate the correctness of our assumptions about the pattern collection and the interestingness measure.作者: instructive 時(shí)間: 2025-3-31 10:09 作者: HAWK 時(shí)間: 2025-3-31 13:46 作者: dermatomyositis 時(shí)間: 2025-3-31 19:43
Germán Puebla,Francisco Bueno,Manuel Hermenegildovery effective at supporting data mining. Finally, we turn our attention to the related problem of supporting data stream mining using Data Stream Management Systems (DSMS) and introduce the notion of Inductive DSMS. In addition to continuous query languages, DSMS provide support for synopses, sampl作者: FLORA 時(shí)間: 2025-3-31 21:43 作者: gusher 時(shí)間: 2025-4-1 02:43
