Titlebook: Logic Program Synthesis and Transformation; 5th International Wo Maurizio Proietti Conference proceedings 1996 Springer-Verlag Berlin Heide

令人不快

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

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

placebo

membrane

水土

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

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

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

多嘴

Blanch

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