We present an overview of the program transformation methodology, focusing our attention
on the so-called “rules+ strategies” approach in the case of functional and logic programs …

We present an overview of some techniques which have been proposed for the
transformation of logic programs. We consider the so-called “rules+ strategies” approach …

The validation of specifications with respect to user requirements is extremely difficult. To
ease the validation task and to give users immediate feedback on the behaviour of the future …

The inductive synthesis of recursive logic programs from incomplete information, such as
input/output examples, is a challenging subfield both of Inductive Logic Programming (ILP) …

We survey termination analysis techniques for Logic Programs. We give an extensive
introduction to the topic. We recall several motivations for the work, and point out the …

The representation of uncertainty is a central issue in Artificial Intelligence (AI) and is being
addressed in many different ways. Each approach has its proponents, and each has had its …

Abstract The specification language Attempto Controlled English (ACE) is a controlled
natural language, ie a subset of standard English with a domain-specific vocabulary and a …

We provide a theoretical basis for studying termination of (general) logic programs with the
Prolog selection rule. To this end we study the class of left terminating programs. These are …

This paper presents an overview and a survey of logic program synthesis. Logic program
synthesis is interpreted here in a broad way; it is concerned with the following question …

Since the early days of programming and automated reasoning, researchers have
developed methods for systematically constructing programs from their specifications …