Titlebook: Logic Program Synthesis and Transformation - Meta-Programming in Logic; 4th International Wo Laurent Fribourg,Franco Turini Conference proc

Fabric

,Partial evaluation of the “real thing”,cts and the operational predicate if-then-else. We outline a denotational semantics for this subset of Prolog and show how partial deduction can be extended to specialise programs of this kind. We point out some of the problems not occurring in partial deduction and show how they can be solved in ou

ACE-inhibitor

Schema-based top-down design of logic programs using abstract data types,ain components to this approach: top-down design, program schemata and ADTs, all of which are already well established notions. Our aim is to combine these ideas in a framework, amenable to support by design tools and allowing the use of existing logic program transformation techniques to optimise t

骯臟

Generalizing extended execution for normal programs,y means of replacement, simplification and rewriting. This work can be seen as a generalization of . [16] which is in turn an extension of the prolog interpreter. We show the soundness of our generalization and discuss its completeness. Two extensive examples are given. We conclude on the relevance

Abbreviate

Hla461

Avoiding non-termination when learning logic programs: A case study with FOIL and FOCL,e their search space. However, they seldom take into account the fact that the lattice defined by Plotkin is a set of equivalence classes rather than simple clauses. This may lead to non-terminating learning processes, since the search gets stuck within an equivalence class, which contains an infini

noxious

,Propagation of inter-argument dependencies in “Tuple-distributive” type inference systems,s, dependencies specified by head-only shared variables cannot be handled, and the inferred types are often very inaccurate. In this paper, we define an unfolding process which propagates such inter-argument dependencies: each call to a predicate that contains head-only shared variables is replaced

Narrative

強所

Oratory

A model of costs and benefits of meta-level computation,ns. However, the question arises to what extent the cost of meta-computation offsetts the gains made by object-level savings. In this paper we discuss a set of equations that model this trade-off between object-savings and meta-costs. The model shows that there are a number of important limitations

In-Situ

Logic programs with tests,d Stable Model Semantics are extended to give meaning to programs with ...We consider three possible applications of such programs. It is shown how to define a particular semantics in terms of another one with the help of an appropriate transformation of normal programs into programs with tests. Our