InhaltsangabeConcurrent constraint programming.- Specifications using multiple-conclusion logic programs.- Viewing a program transformation system at work.- Proving implications by algebraic approximation.- Sufficient completeness and parameterized proofs by induction.- Proving behavioural theorems with standard first-order logic.- How to realize LSE narrowing.- Compositional analysis for equational Horn programs.- Equation solving in projective planes and planar ternary rings.- From eventual to atomic and locally atomic CC programs: A concurrent semantics.- Concurrent logic programming as uniform linear proofs.- Three-valued completion for abductive logic programs.- A sequential reduction strategy.- On modularity of termination and confluence properties of conditional rewrite systems.- Syntactical analysis of total termination.- Logic programs as term rewriting systems.- Higher-order minimal function graphs.- Reasoning about layered, wildcard and product patterns.- Preserving universal termination through unfold/fold.- A logic for variable aliasing in logic programs.