標(biāo)題: Titlebook: Logic Program Synthesis and Transformation; 5th International Wo Maurizio Proietti Conference proceedings 1996 Springer-Verlag Berlin Heide [打印本頁(yè)] 作者: Anagram 時(shí)間: 2025-3-21 17:27
書目名稱Logic Program Synthesis and Transformation影響因子(影響力)
書目名稱Logic Program Synthesis and Transformation影響因子(影響力)學(xué)科排名
書目名稱Logic Program Synthesis and Transformation網(wǎng)絡(luò)公開度
書目名稱Logic Program Synthesis and Transformation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logic Program Synthesis and Transformation被引頻次
書目名稱Logic Program Synthesis and Transformation被引頻次學(xué)科排名
書目名稱Logic Program Synthesis and Transformation年度引用
書目名稱Logic Program Synthesis and Transformation年度引用學(xué)科排名
書目名稱Logic Program Synthesis and Transformation讀者反饋
書目名稱Logic Program Synthesis and Transformation讀者反饋學(xué)科排名
作者: 敵意 時(shí)間: 2025-3-21 21:43 作者: delta-waves 時(shí)間: 2025-3-22 01:37 作者: Lipoprotein(A) 時(shí)間: 2025-3-22 04:35 作者: braggadocio 時(shí)間: 2025-3-22 12:08 作者: Gingivitis 時(shí)間: 2025-3-22 13:21 作者: 不透明 時(shí)間: 2025-3-22 19:14 作者: Largess 時(shí)間: 2025-3-23 01:17
Transformation of left terminating programs: The reordering problem,we study the reasons why left termination may be spoiled by the application of a transformation operation and we present a transformation system based on the operations of Unfold, Fold and Switch which — if applied to a left terminating programs — yields a program which is left terminating as well.作者: MENT 時(shí)間: 2025-3-23 03:54 作者: 使入迷 時(shí)間: 2025-3-23 09:31 作者: 令人不快 時(shí)間: 2025-3-23 10:24
Derivation of concurrent algorithms in Tempo,f this paper. Here we present a few transformation rules that can be applied to Tempo programs, and then describe in detail the derivation of some concurrent algorithms in Tempo. An outline of the Tempo language is also included in order to make the paper self-contained.作者: ADORE 時(shí)間: 2025-3-23 17:14
Ideal refinement of Datalog programs,ng induced upon a set of clauses by the generalization model of .. These operators have been implemented in a system for theory revision that proved effective in the area of electronic document classification.作者: compose 時(shí)間: 2025-3-23 21:44 作者: placebo 時(shí)間: 2025-3-24 00:42 作者: membrane 時(shí)間: 2025-3-24 05:33 作者: 水土 時(shí)間: 2025-3-24 08:13
Memoing evaluation by source-to-source transformation,.The first step consists of magic sets rewriting [BR91], a standard transformation in deductive databases, whose application to Prolog has not been considered yet..The second transformation rewrites bottom-up rules to Prolog clauses. This new bottom-up to top-down transformation has useful applicati作者: Demulcent 時(shí)間: 2025-3-24 12:38
Transformation of left terminating programs: The reordering problem,on should preserve the main properties of the initial program: among them, termination. When dealing with logic programs such as PROLOG programs, one is particularly interested in preserving . i.e. termination wrt the leftmost selection rule, which is by far the most widely employed of the search ru作者: Rheumatologist 時(shí)間: 2025-3-24 18:31
Derivation of concurrent algorithms in Tempo, manner than existing languages. One of the benefits of declarative programming is the potential for systematic derivation of programs — the subject of this paper. Here we present a few transformation rules that can be applied to Tempo programs, and then describe in detail the derivation of some con作者: 多嘴 時(shí)間: 2025-3-24 21:01 作者: Blanch 時(shí)間: 2025-3-25 02:02
Studying the cost of logic languages in an abstract interpretation framework for granularity analysnt a framework based on the abstract interpretation technique to obtain information about these program characteristics and show how its execution time can be improved using the analysis..The method proposed is realized partially in compile time and partially during execution in order to minimize th作者: blackout 時(shí)間: 2025-3-25 06:56 作者: anaerobic 時(shí)間: 2025-3-25 10:26
Guiding program development systems by a connection based proof strategy,rategy extends Bibel‘s connection method for classical predicate logic. It generates a matrix proof which will then be transformed into a proof within a standard sequent calculus. Thus we can use an efficient proof method to guide the development of constructive proofs in interactive proof/program d作者: OWL 時(shí)間: 2025-3-25 11:50 作者: cataract 時(shí)間: 2025-3-25 19:25
Logic program synthesis by induction over Horn Clauses,ork by Feferman [1], and allows constructive proof by induction over the minimal Herbrand model of a set of Horn Clauses. This is an important addition to the Whelk system, because it admits reasoning about and synthesis from “real” logic programs, whereas previously the system was limited to induct作者: 值得尊敬 時(shí)間: 2025-3-25 21:40 作者: CIS 時(shí)間: 2025-3-26 01:44
An opportunistic approach for logic program analysis and optimisation using enhanced schema-based tattempted, either by examining its procedures in an isolated fashion, or by checking for conjunctions within clauses that can be used as joint specifications. Opportunities are represented as ., generic descriptions of inefficient programming constructs and of how these should be altered in order to作者: 裙帶關(guān)系 時(shí)間: 2025-3-26 06:10 作者: Irremediable 時(shí)間: 2025-3-26 10:30
Towards a complete proof procedure to prove properties of normal logic programs under the completiorams and an extension to normal ones was proposed afterwards. The correctness of the extended framework has been shown and in this paper we investigate the question of its completeness. We give results at the propositional level and discuss a possible alternative to achieve completeness at the non p作者: otic-capsule 時(shí)間: 2025-3-26 13:17
Termination of logic programs using semantic unification, the logic program follows from termination of the derived constructor system. Thereafter, we present a new technique to prove termination of constructor systems. In the technique semantic unification is used. Thus, surprisingly, semantic unification can be used For giving termination proofs for log作者: 定點(diǎn) 時(shí)間: 2025-3-26 20:53
On the mechanics of metasystem hierarchies in program transformation,eason about the mechanics of hierarchies of program transformers and to describe applications that go beyond the ‘classical’ Futamura projections. This paper identifies and clarifies foundational issues involved in multi-level metasystem hierarchies. After studying the role of abstraction, encoding,作者: 燦爛 時(shí)間: 2025-3-26 21:21 作者: 幾何學(xué)家 時(shí)間: 2025-3-27 04:01 作者: 壕溝 時(shí)間: 2025-3-27 05:46
Michael Leuschelntary material: .Unser Kind hat Diabetes – was nun?..Wird bei einem Kind Diabetes diagnostiziert, ist in seinem Leben nichts mehr so, wie es vorher war. Die ersten Fragen, die sich Eltern stellen, wenn der Kinderarzt ihnen die Diagnose Diabetes mitteilt, sind meist:..Wie wird unser Kind damit umgehe作者: MEN 時(shí)間: 2025-3-27 10:04 作者: botany 時(shí)間: 2025-3-27 14:42
Annalisa Bossi,Nicoletta Cocco,Sandro Etalleagen, die sich Eltern stellen, wenn der Kinderarzt ihnen die Diagnose Diabetes mitteilt, sind meist:..Wie wird unser Kind damit umgehen? ..Wie k?nnen wir ihm helfen? ..Was hat das für Folgen für unsere Familie? ..Weitere Fragen nach dem richtigen Einsatz von Insulin, der gesunden Ern?hrung, der Diab作者: Console 時(shí)間: 2025-3-27 19:03
Steve Gregoryagen, die sich Eltern stellen, wenn der Kinderarzt ihnen die Diagnose Diabetes mitteilt, sind meist:..Wie wird unser Kind damit umgehen? ..Wie k?nnen wir ihm helfen? ..Was hat das für Folgen für unsere Familie? ..Weitere Fragen nach dem richtigen Einsatz von Insulin, der gesunden Ern?hrung, der Diab作者: misshapen 時(shí)間: 2025-3-28 00:03 作者: 我吃花盤旋 時(shí)間: 2025-3-28 03:46 作者: debble 時(shí)間: 2025-3-28 06:22 作者: larder 時(shí)間: 2025-3-28 12:46
Fred Mesnardhaft und Kindheitssoziologie an? Im vorliegenden Beitrag wird ein hochschuldidaktisches Szenario vorgestellt und diskutiert, das diese Frage aufgreift. In der konstruktivistischen Verortung zeigt sich ein Lernprozess, der eigene Konstruktionen von Kindheitsbildern, Rekonstruktionen disziplin?rer Log作者: exceptional 時(shí)間: 2025-3-28 18:37 作者: defendant 時(shí)間: 2025-3-28 22:04
Christoph Kreitz,Jens Otten,Stephan Schmittger ist eine Demokratie nicht funktionsf?hig. Eine ?gelungene‘ politische Sozialisation ist deshalb für die Demokratie von gro?er Bedeutung. W?hrend sich die neuere politische Sozialisationsforschung auf die Untersuchung von Jugendlichen konzentriert und Grundschulkinder nur selten Forschungsgegenst作者: 被詛咒的人 時(shí)間: 2025-3-29 01:14 作者: Inferior 時(shí)間: 2025-3-29 04:00 作者: 貪婪性 時(shí)間: 2025-3-29 08:26 作者: neoplasm 時(shí)間: 2025-3-29 14:47
Wamberto W. Vasconcelos,Norbert E. Fuchsund mit ?Vitaminen gest?rkt“ seinen Tag. In der ersten Pause - ?halb zehn in Deutschland“ — verzehrt es sein ., in der zweiten Pause die ?wertvolle . oder ein . Im Gegensatz zu den weniger glücklichen Kinder, die der Lehrerin auch nicht durch ein .-gewaschenes Kleidchen positiv auffallen, freut sich作者: SLAG 時(shí)間: 2025-3-29 17:40 作者: 溫和女孩 時(shí)間: 2025-3-29 20:23
978-3-540-60939-1Springer-Verlag Berlin Heidelberg 1996作者: 急急忙忙 時(shí)間: 2025-3-30 00:21 作者: abstemious 時(shí)間: 2025-3-30 07:03 作者: Harrowing 時(shí)間: 2025-3-30 12:06
Towards an object-oriented methodology for deductive synthesis of logic programs,d inheritance (informally). In this paper, we show how our existing approach to deductive synthesis of logic programs can serve as the basis for an object-oriented methodology for formal program development that achieves reusability, extensibility and correctness (formally).作者: 指數(shù) 時(shí)間: 2025-3-30 15:10 作者: landfill 時(shí)間: 2025-3-30 18:23
Solving deductive planning problems using program analysis and transformation,em, are investigated. The work is based on a resource oriented approach to reasoning about actions and change using a logic programming paradigm. We show that ordinary resolution methods are insufficient for solving these problems and propose program analysis and transformation as a more promising and successful way to solve them.作者: 敲竹杠 時(shí)間: 2025-3-30 22:55 作者: Expediency 時(shí)間: 2025-3-31 04:57
https://doi.org/10.1007/3-540-60939-3Horn Clauses; Horn-Klauseln; Logic Programming; Logisches Programmieren; Program Semantics; Program Synth作者: 上釉彩 時(shí)間: 2025-3-31 07:04 作者: 煩憂 時(shí)間: 2025-3-31 11:28
Complexity of Horn programs,This paper gives a method to estimate the space and time complexity of Horn programs executed under the OLDT search strategy (also called Earley Deduction or memoing).作者: 失敗主義者 時(shí)間: 2025-3-31 15:24
,Towards automatic control for CLP(χ) programs,We discuss issues of control for constraint logic programs. The problem we try to solve is to find, from the text of a program, a computation rule which ensures finiteness of the computation tree. In a single framework, we address two related areas, namely the generation of control annotations and the local level of control for partial deduction.作者: Fabric 時(shí)間: 2025-3-31 19:16
Ecological partial deduction: Preserving characteristic trees without constraints, which achieves the preservation of characteristic trees for . unfolding rule, . logic programs (it can even handle some built-in‘s if so desired) and . adding constraints to the partial deduction process (making the re-use of existing unfolding techniques very simple). We thus provide a powerful, g作者: 使害羞 時(shí)間: 2025-3-31 22:15
Studying the cost of logic languages in an abstract interpretation framework for granularity analysogram. During transformed program execution, a process will be moved to a remote node only if the relation between the computational and communication costs given by the analysis will improve its execution.作者: 泄露 時(shí)間: 2025-4-1 03:43
