This volume contains the main papers presented at the International Conference on Analytic Tableaux and Related Methods (TABLEAUX 2000) held on July 3-7, 2000 in St Andrews, Scotland. This conference succeeded other meetings on the same topic held in Lautenbach (1992), Marseille (1993), Abingdon (1994), St Goar (1995), Terrasini (1996), Pont-' a-Mousson (1997), Oisterwijk (1998) and Saratoga Springs (1999). Tableaux and related methods, such as Gentzen calculi, are convenient and e?ective for automating deduction not just in classical logic but also in various non-standard logics. Examples taken from this meeting alone include temporal, description, non-monotonic, tense, modal, epistemic, fuzzy and intuitionistic - gics. Areas of application include veri?cation of software and computer systems, deductive databases, knowledge representation and system diagnosis. The c- ference brought together researchers interested in all aspects - theoretical fo- dations, implementation techniques, systems development, experimental com- rison and applications - of the automation of reasoning by means of tableaux or related methods.

This book constitutes the refereed proceedings of the 5th International Workshop on Extensions of Logic Programming, ELP '96, held in Leipzig, Germany in March 1996.
The 18 full papers included were carefully selected by the program committee and are presented together with three invited papers. Among the topics addressed in this book are categorical logic programming, correctness of logic programs, functional-logic languages, implementation issues, linear logic programming, nonmonotonic reasoning, and proof search.

The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.