標(biāo)題: Titlebook: Logic Program Synthesis and Transformation; Proceedings of LOPST Timothy Paul Clement,Kung-Kiu Lau Conference proceedings 1992 Springer-Ver [打印本頁(yè)] 作者: Motion 時(shí)間: 2025-3-21 17:59
書(shū)目名稱Logic Program Synthesis and Transformation影響因子(影響力)
書(shū)目名稱Logic Program Synthesis and Transformation影響因子(影響力)學(xué)科排名
書(shū)目名稱Logic Program Synthesis and Transformation網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Logic Program Synthesis and Transformation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Logic Program Synthesis and Transformation被引頻次
書(shū)目名稱Logic Program Synthesis and Transformation被引頻次學(xué)科排名
書(shū)目名稱Logic Program Synthesis and Transformation年度引用
書(shū)目名稱Logic Program Synthesis and Transformation年度引用學(xué)科排名
書(shū)目名稱Logic Program Synthesis and Transformation讀者反饋
書(shū)目名稱Logic Program Synthesis and Transformation讀者反饋學(xué)科排名
作者: dictator 時(shí)間: 2025-3-21 21:18 作者: pericardium 時(shí)間: 2025-3-22 03:40 作者: TRACE 時(shí)間: 2025-3-22 06:16
Program Equivalence, Program Development and Integrity Checking,the program. This results in a method which allows program equivalence to be analysed retrospectively without placing restrictions on the manner in which one version of a program can be derived from another.作者: averse 時(shí)間: 2025-3-22 11:13
Formal validation of transformation schemata,r logic. Let ? be a transformation scheme which is proved correct. If we apply the scheme ? to a (first-order) program, the resulting program . the same set of solutions as the original one..We exemplify the method by proving the correctness of unfold/fold transformation, and of a scheme, which replaces recursion by tail-recursion.作者: Subjugate 時(shí)間: 2025-3-22 14:20 作者: 中子 時(shí)間: 2025-3-22 18:16 作者: 吹牛大王 時(shí)間: 2025-3-23 01:16
,Semantics—based Partial Evaluation of Prolog Programs,mantic modelling of the basic control component of the partial evaluation process is possible. Conversely, the CCS semantics can determine whether particular partial evaluation transformations violate program completeness.作者: 偽造者 時(shí)間: 2025-3-23 02:28 作者: 五行打油詩(shī) 時(shí)間: 2025-3-23 08:54 作者: 散布 時(shí)間: 2025-3-23 21:43
Towards Synthesis of Nearly Pure Prolog Programs,ith the most general clause. IDS can also build new clauses by inductive inference. The following operators for generalization/specialization are used: adding/removing subgoals, instantiating variables and unifying two terms.作者: 一加就噴出 時(shí)間: 2025-3-23 23:46 作者: 奴才 時(shí)間: 2025-3-24 02:25 作者: 無(wú)脊椎 時(shí)間: 2025-3-24 07:21 作者: opprobrious 時(shí)間: 2025-3-24 12:57
Christophe Lecoutre,Philippe Devienne,Patrick Lebeguemanns et al). Grunds?tzlich ist es das Ziel von best?rkender Sozialarbeit, bei den St?rken der Klienten anzusetzen und ihnen bei der Entdek-kung ihrer eigenen M?glichkeiten zu helfen. Empowerment ist dann erfolgreich, wenn die best?rkten Personen gr??tm?gliche Kontrolle über ihr Leben gewinnen und d作者: 油氈 時(shí)間: 2025-3-24 15:05
Jutta Eusterbrockmanns et al). Grunds?tzlich ist es das Ziel von best?rkender Sozialarbeit, bei den St?rken der Klienten anzusetzen und ihnen bei der Entdek-kung ihrer eigenen M?glichkeiten zu helfen. Empowerment ist dann erfolgreich, wenn die best?rkten Personen gr??tm?gliche Kontrolle über ihr Leben gewinnen und d作者: 留戀 時(shí)間: 2025-3-24 22:42 作者: 有害 時(shí)間: 2025-3-25 03:15
D. A. de Waal,J. Gallaghermanns et al). Grunds?tzlich ist es das Ziel von best?rkender Sozialarbeit, bei den St?rken der Klienten anzusetzen und ihnen bei der Entdek-kung ihrer eigenen M?glichkeiten zu helfen. Empowerment ist dann erfolgreich, wenn die best?rkten Personen gr??tm?gliche Kontrolle über ihr Leben gewinnen und d作者: inclusive 時(shí)間: 2025-3-25 04:58
Brian J. Rossmanns et al). Grunds?tzlich ist es das Ziel von best?rkender Sozialarbeit, bei den St?rken der Klienten anzusetzen und ihnen bei der Entdek-kung ihrer eigenen M?glichkeiten zu helfen. Empowerment ist dann erfolgreich, wenn die best?rkten Personen gr??tm?gliche Kontrolle über ihr Leben gewinnen und d作者: 疼死我了 時(shí)間: 2025-3-25 08:26 作者: abnegate 時(shí)間: 2025-3-25 14:11 作者: 生來(lái) 時(shí)間: 2025-3-25 15:53
Synthesis and Transformation of Logic Programs from Constructive, Inductive Proof,used to show that the specification of a program is realisable; elaboration of a proof gives rise to the synthesis of a program which realises it. We present an update on earlier ideas, and give examples of and justification for them. The work is presented as foundation for further work in ., where 作者: Ingredient 時(shí)間: 2025-3-25 22:03 作者: intrigue 時(shí)間: 2025-3-26 02:59
Inductive Synthesis of Rewrite Rules as Program Synthesis, We are not concerned with explicitly known incompleteness during an unfinished design process. Instead, the present approach is focussed on specifications which are either a little incomplete by mistake or intentionally incomplete as descriptions by examples are. Completing given specifications to 作者: 好忠告人 時(shí)間: 2025-3-26 05:36 作者: Polydipsia 時(shí)間: 2025-3-26 09:58
Towards Synthesis of Nearly Pure Prolog Programs, (either positive or negative), and metaknowledge about procedures are used as input. A refinement operator then uses breadth first search beginning with the most general clause. IDS can also build new clauses by inductive inference. The following operators for generalization/specialization are used作者: receptors 時(shí)間: 2025-3-26 16:40 作者: Amorous 時(shí)間: 2025-3-26 19:21 作者: ostracize 時(shí)間: 2025-3-27 00:54
An Automatic Transformation Strategy for Avoiding Unnecessary Variables in Logic Programs,ing the meaning of programs. Often one also uses variables which are ., in the sense that they are not required for describing the input-output relation. Unnecessary variables are used by the programmer because they often allow for a more transparent way of writing programs or an easier proof of the作者: PANG 時(shí)間: 2025-3-27 03:42
On Using Mode Input-output for Transforming Logic Programs,irst we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we e作者: Insufficient 時(shí)間: 2025-3-27 08:16
Abstract Intepretation and recursive behaviour of logic programs,ataflow analysis of a program execution and the automatic derivation of some program properties..First, we introduce a new notion: the limited-unfolding loop (abbreviated to lul). Roughly speaking, a tree t satisfies a lul m iff the leaf of the branch corresponding to the unfolding of the loop m is 作者: 聲明 時(shí)間: 2025-3-27 12:47 作者: A保存的 時(shí)間: 2025-3-27 17:30
Pruning Operators for Partial Evaluation,rams. For logic programs, it has been shown that, under certain conditions, a partial evaluation of a program is computationally equivalent to the original program. Unfortunately, these results only apply to programs without control directives..In this paper, we consider the difficulties of partiall作者: Instinctive 時(shí)間: 2025-3-27 20:14
Specialisation of a Unification Algorithm,several specialisations of unification that are typically needed. The limitations of existing partial evaluation techniques are examined and proposals for extensions are made. Partial evaluation is modified by adding condition goals which are used to evaluate or prune more of the computation tree th作者: 聰明 時(shí)間: 2025-3-28 00:48 作者: 把…比做 時(shí)間: 2025-3-28 02:19
Prolog Program Transformations and Meta-Interpreters,structured program in a more efficient program (that is to say better adapted to the interpreter or compiler). These programs are Prolog programs semantically equivalent with respect to the least Herbrand model. Our context is the operational equivalence of programs, and not the efficiency of progra作者: 急急忙忙 時(shí)間: 2025-3-28 07:17
Global Search Algorithms and the Constraint Logic Programming Framework,as studied in the functional programming framework in [Smith88], and in the logic programming framework in [Schaeck91]..The constraint logic programming (CLP) framework is also a very interesting tool for designing programs solving combinatorial problems. A method for designing CLP programs, based o作者: Carminative 時(shí)間: 2025-3-28 12:12 作者: GLIB 時(shí)間: 2025-3-28 15:03 作者: Reclaim 時(shí)間: 2025-3-28 19:40 作者: Audiometry 時(shí)間: 2025-3-29 01:21
Workshops in Computinghttp://image.papertrans.cn/l/image/587883.jpg作者: HACK 時(shí)間: 2025-3-29 04:30 作者: Expressly 時(shí)間: 2025-3-29 08:22 作者: connoisseur 時(shí)間: 2025-3-29 13:11
https://doi.org/10.1007/978-1-4471-3494-7Logic Programming transformation; Logic programming synthesis; Program development; Variable; algorithms作者: 胡言亂語(yǔ) 時(shí)間: 2025-3-29 15:49 作者: 廢止 時(shí)間: 2025-3-29 23:32 作者: FEMUR 時(shí)間: 2025-3-30 02:22
Jutta Eusterbrockgen für die Betroffenen, die Professionellen und die Strukturen Sozialer Arbeit. Empowermentkonzepte der Kriminalit?tspr?vention stehen in der Pflicht, nachzuweisen, was genau unter dem positiven, aber auch vieldeutigen Begriff des Empowerments verstanden wird und vor allem, welche praktischen und t作者: expository 時(shí)間: 2025-3-30 04:06 作者: 土坯 時(shí)間: 2025-3-30 09:58
D. A. de Waal,J. Gallaghergen für die Betroffenen, die Professionellen und die Strukturen Sozialer Arbeit. Empowermentkonzepte der Kriminalit?tspr?vention stehen in der Pflicht, nachzuweisen, was genau unter dem positiven, aber auch vieldeutigen Begriff des Empowerments verstanden wird und vor allem, welche praktischen und t作者: 高調(diào) 時(shí)間: 2025-3-30 16:14
Brian J. Rossgen für die Betroffenen, die Professionellen und die Strukturen Sozialer Arbeit. Empowermentkonzepte der Kriminalit?tspr?vention stehen in der Pflicht, nachzuweisen, was genau unter dem positiven, aber auch vieldeutigen Begriff des Empowerments verstanden wird und vor allem, welche praktischen und t作者: Infelicity 時(shí)間: 2025-3-30 16:38 作者: 嫌惡 時(shí)間: 2025-3-30 20:55 作者: staging 時(shí)間: 2025-3-31 00:54 作者: lactic 時(shí)間: 2025-3-31 05:20
Global Search Algorithms and the Constraint Logic Programming Framework,ept used in global search algorithms finds its counterpart in the schema used for constructing CLP programs or in the mechanisms of constraint logic programming languages. This convinces us that a CLP program can be considered as an instance of a global search algorithm, even if it does not have suc作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-31 11:07 作者: integrated 時(shí)間: 2025-3-31 13:45
1431-1682 te record of the workshop, with all the papers reproduced either in full or as extended abstracts. They cover a wide range of aspects, both practical and theore978-3-540-19742-3978-1-4471-3494-7Series ISSN 1431-1682 作者: 滋養(yǎng) 時(shí)間: 2025-3-31 17:56
1430-9491 nvironments.Uses linear matrix inequality methods to allow t.A recent development in SDC-related problems is the establishment of intelligent SDC models and the intensive use of LMI-based convex optimization methods. Within this theoretical framework, control parameter determination can be designed 作者: DEAF 時(shí)間: 2025-4-1 00:59 作者: 喚起 時(shí)間: 2025-4-1 03:33
Microwave and Joule Heating Visualization by a Thermo-Elastic Microscope for Carbon Composite Matertained microwave heat visualization data was in good agreement with the simulated result. Additionally, noninvasive Joule heating (around 1 K) made by 0.3 A DC flux was observed in order to characterize mechanical faults in a composite material.作者: FLAT 時(shí)間: 2025-4-1 08:56 作者: 披肩 時(shí)間: 2025-4-1 13:00
Elena F. Grekova,Sabina M. Isaevao add the other points back effectively. We discuss the heuristics to find a sketch for .. Our approach is based on the observation that a better sketch with the same number of points is the sketch over which its optimal tour is larger in length. In addition, as the number of such points is to be sm作者: 一回合 時(shí)間: 2025-4-1 16:17
Analysis of Injury Severities of Accidents Involving Low-Emission Vehicless with electric and hybrid vehicles. Through inferential statistical tests and models, this analysis controls for factors, such as the accident location, road and driver characteristics, with a goal to identify the key factors contributing to the occurrence of accidents and quantify their impact on 作者: Magnificent 時(shí)間: 2025-4-1 19:37
Marke Ahonen data analysis techniques.? Written in the highly successful .Methods in Molecular Biology?. series format, chapters include introductions to their respective topics, lists of the necessary materials and reagen978-1-4939-6174-0978-1-61779-043-0Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: 本能 時(shí)間: 2025-4-2 02:19
Schultypologien mehr Platz für n?tig halten, k?nnen sie über diese Vorgaben nicht hinausgehen, ohne das Budget zu sprengen. Da der Schulbau ohnehin vorbestimmten technischen Anforderungen folgt und aus Steuergeldern finanziert wird, tr?gt die britische Regierung die Verantwortung, dass bestimmte Standards eingehal作者: Disk199 時(shí)間: 2025-4-2 05:37 作者: 受傷 時(shí)間: 2025-4-2 09:40
pite of the fact that some of the basic concepts of the theory of benzenoid hydrocarbons have their origins in the 19th and early 20th century, research in this area is still in vigorous expansion. The present book provides an outline of the most important current theoretical approaches to benzenoid
