InhaltsangabeRefining specifications to logic programs.- Symbolic verification with gap-order constraints.- Specification-based automatic verification of Prolog programs.- Logic program specialisation: How to be more specific.- Conjunctive partial deduction in practice.- Redundant argument filtering of logic programs.- Replacement can preserve termination.- A transformation tool for pure Prolog programs.- Enhancing partial deduction via unfold/fold rules.- Abstract specialization and its application to program parallelization.- Reductions of petri nets and unfolding of propositional logic programs.- Inferring argument size relationships with CLP( $$\mathcal{R}$$ ).- Typed norms for typed logic programs.- Partial deduction in the framework of structural synthesis of programs.- Extensible logic program schemata.- Specialising meta-level compositions of logic programs.- Forms of logic specifications: A preliminary study.- Synthesis of proof procedures for default reasoning.