標(biāo)題: Titlebook: Logic-Based Program Synthesis and Transformation; 8th International Wo Pierre Flener Conference proceedings 1999 Springer-Verlag Berlin Hei [打印本頁] 作者: ACORN 時間: 2025-3-21 19:50
書目名稱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é)科排名
作者: ANA 時間: 2025-3-21 22:41 作者: Perennial長期的 時間: 2025-3-22 04:00 作者: 雜色 時間: 2025-3-22 07:27
Jeffrey Van Baalen,Steven Roachrencing and categorizing data. These standardized terms are then stored in record-based semantic specifications that store metadata and semantic descriptions of the data. Using these semantic specifications, it is possible to integrate diverse data sources even though they were not originally design作者: TOM 時間: 2025-3-22 11:24 作者: 死貓他燒焦 時間: 2025-3-22 15:28 作者: Antecedent 時間: 2025-3-22 17:16
Julian Richardsonbilities occurred after the landfall. The majority (73%) of unreachable subnets lasted longer than four weeks showing that Katrina caused extreme damage on networks and a slow recovery..Network-service disruption is inevitable after large-scale natural disasters occur. Thus, it is crucial to have ef作者: consent 時間: 2025-3-22 21:31 作者: mechanical 時間: 2025-3-23 05:28
The Use of Renaming in Composing General Programs,grams proposed by Fitting [.]. A computational interpretation of program compositions is formalised by means of an equivalence preserving transformation of arbitrary program compositions into standard general programs.作者: defibrillator 時間: 2025-3-23 09:12 作者: 馬籠頭 時間: 2025-3-23 12:31
Norbert E. Fuchs,Uta Schwertel,Rolf Schwitterferent ways and to many different levels of granularity accordingto domain generalization graphs. In the interpretation and evaluationstep, we study diversity m978-1-4419-4913-4978-1-4757-3283-2Series ISSN 0893-3405 作者: Immunotherapy 時間: 2025-3-23 14:34
Dante Baldan,Baudouin Le Charlier,Christophe Leclère,Isabelle Polletferent ways and to many different levels of granularity accordingto domain generalization graphs. In the interpretation and evaluationstep, we study diversity m978-1-4419-4913-4978-1-4757-3283-2Series ISSN 0893-3405 作者: cacophony 時間: 2025-3-23 20:30
https://doi.org/10.1007/3-540-48958-4Automated Program Development; Logic Programming; Program Synthesis; Program Transformation; Programming作者: chemoprevention 時間: 2025-3-24 00:26
OOD Frameworks in Component-Based Software - Development in Computational Logic,r groups of interacting objects, are a better unit of reuse. Thus, in next-generation Component-based Development (CBD) methodologies, we can expect components to be frameworks rather than objects. In this paper, we describe a preliminary attempt at a formal semantics for OOD frameworks in CBD in computational logic.作者: companion 時間: 2025-3-24 03:05 作者: FLAT 時間: 2025-3-24 06:50 作者: esculent 時間: 2025-3-24 12:11 作者: Visual-Acuity 時間: 2025-3-24 16:57
978-3-540-65765-1Springer-Verlag Berlin Heidelberg 1999作者: 粗糙 時間: 2025-3-24 22:53
Logic-Based Program Synthesis and Transformation978-3-540-48958-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 可用 時間: 2025-3-24 23:18 作者: 周興旺 時間: 2025-3-25 05:07
Pragmatics in the Synthesis of Logic Programs,igns but do not necessarily provide guidance in design lifecycles - where less detailed designs are used to guide the description of more detailed designs. The second half of this paper summarises an example of this form of guidance.作者: Dislocation 時間: 2025-3-25 11:32
,Attempto Controlled English — Not Just Another Logic Specification Language,rocessable. ACE specifications can be unambiguously translated into logic specification languages, and can be queried and executed. In brief, ACE allows domain specialists to express specifications in familiar natural language and combine this with the rigour of formal specification languages.作者: 爭論 時間: 2025-3-25 15:14 作者: Ostrich 時間: 2025-3-25 16:01
Generalization in Hierarchies of Online Program Specialization Systems,er developing and formalizing the basic metaprogramming concepts, we extend two basic methods to multiply encoded data: most specific generalization and the homeomorphic embedding relation. Examples and experiments with the initial design of an online specializer illustrate their use in hierarchies of online program specializers.作者: 鞏固 時間: 2025-3-25 21:51
Improving Homeomorphic Embedding for Online Termination,also illustrate that the homeomorphic embedding relation suffers from several inadequacies in contexts where logical variables arise. We therefore present new, extended homeomorphic embedding relations to remedy this problem.作者: Panther 時間: 2025-3-26 00:34 作者: MIME 時間: 2025-3-26 05:24
0302-9743 ic specification, mathematical program construction, logic programming, computational logics, inductive program synthesis, constraint logic programs, and mathematical foundations.978-3-540-65765-1978-3-540-48958-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 從屬 時間: 2025-3-26 09:33
0302-9743 Transformation, LOPSTR‘98 held in Manchester, UK in June 1998. The 16 revised full papers presented were carefully reviewed and selected during three rounds of inspection from a total of initially 36 extended abstracts submitted. Also included are eight short papers. Among the topics covered are log作者: 河流 時間: 2025-3-26 14:05 作者: leniency 時間: 2025-3-26 18:39
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes,ailing ILP approaches. Moreover, the combinator form avoids confusing object and metavariables in the applied metalogic program environment. In addition useful algebraic rewriting rules can be formulated conveniently with the combinators.作者: 牽連 時間: 2025-3-27 01:02 作者: BIBLE 時間: 2025-3-27 04:24
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declar in several modes; it is shown that block declarations, which are a very simple delay construct, are sufficient to ensure the desired properties; the selection rule is taken into account, assuming it to be the rule of most Prolog implementations. The methods can be used both to verify existing programs and to assist in writing new programs.作者: Inexorable 時間: 2025-3-27 09:01
Algorithms for Synthesizing Reactive Systems: A Perspective,ful. Nevertheless, essentially none of this work has found its way to practical use. This paper reviews the main results from this area and tries to identify the main reasons that explain their nonexploitation.作者: crescendo 時間: 2025-3-27 10:22
Schema-Guided Synthesis of CLP Programs,ncrementally) poses the constraints, because the actual constraint propagation and pruning are performed by the CLP system. We here only tackle the family of decision assignment problems; the families of optimisation assignment problems, decision permutation problems, and optimisation permutation problems are covered in [.].作者: 銀版照相 時間: 2025-3-27 16:27 作者: 群島 時間: 2025-3-27 18:52 作者: 大溝 時間: 2025-3-28 00:46 作者: 憤慨一下 時間: 2025-3-28 03:27 作者: Offbeat 時間: 2025-3-28 06:40
Dante Baldan,Baudouin Le Charlier,Christophe Leclère,Isabelle Polletedge discovery researcher will find that thematerial provides a theoretical foundation for measures of interest indata mining applications where diversity measures are used to ranksummaries generated from databases. The knowledge discoverypractitioner will find solid empirical evidence on which to b作者: NAVEN 時間: 2025-3-28 11:57
David Robertson,Jaume Agustíed interest in monitoring the firms’ financial performance. Most of the previous studies concerning predicting financial distress were performed for a dichotomous state such as nonbankrupt versus bankrupt or no going concern opinion versus going concern opinion. Many studies used well-balanced sampl作者: FECK 時間: 2025-3-28 16:25 作者: duplicate 時間: 2025-3-28 20:45 作者: 周興旺 時間: 2025-3-29 00:19
Hamza Zidoum,Pierre Flener,Brahim Hniche threat?indicators may or may not be known in advance. Predictive modeling of massive volumes of historical data can yield insights on usual or baseline profiles, which in turn can be utilized to isolate unusual profiles?when new data are observed in real-time.?Thus,?an incremental anomaly detectio作者: Osteoporosis 時間: 2025-3-29 04:15 作者: reflection 時間: 2025-3-29 10:31
,Attempto Controlled English — Not Just Another Logic Specification Language,c vocabulary and a restricted grammar. The restriction of full natural language to a controlled subset is essential for ACE to be suitable for specification purposes. The main goals of this restriction are to reduce ambiguity and vagueness inherent in full natural language and to make ACE computer p作者: HEED 時間: 2025-3-29 14:13
A Step Towards a Methodology for Mercury Program Construction: A Declarative Semantics for Mercury,f the program based on a clear declarative semantics and 2) performing a number of checks about modes, types, termination and multiplicity. We plan to define a similar methodology for Mercury. This choice is motivated by the fact that type, mode, and multiplicity must be explicitly specified in Merc作者: Forsake 時間: 2025-3-29 19:13 作者: reception 時間: 2025-3-29 22:00 作者: 發(fā)現(xiàn) 時間: 2025-3-30 00:17
Synthesis of Programs in Abstract Data Types,allows to build proofs in which . (sequences of application of rules with proper computational content) can be distinguished from . (concerning correctness properties of the algorithm implicitly contained in the proof). The synthesis method associates with every active pattern of the proof a program作者: 男生戴手銬 時間: 2025-3-30 05:08 作者: prosperity 時間: 2025-3-30 11:03 作者: 強制令 時間: 2025-3-30 15:28 作者: Expiration 時間: 2025-3-30 17:53 作者: PUT 時間: 2025-3-31 00:43 作者: Allege 時間: 2025-3-31 02:32 作者: Eructation 時間: 2025-3-31 08:12
Successes in Logic Programs,ur of a program is necessary when dealing with transformation and verification of pure Prolog programs. In a previous work [.] we defined the class of noFD programs and queries which are characterized statically. We proved that a noFD query cannot have finitely failing derivations in a noFD program.作者: rectum 時間: 2025-3-31 12:08 作者: MOT 時間: 2025-3-31 14:24
