Table of Contents

Programming in Alma-0, or imperative and declarative programming reconciled; Church-Rosser property for conditional rewriting systems with built-in predicates as premises; combining WS1S and HOL; a recipe for the complexity analysis of non-classical logics; computer arithmetic - logic, calculus and rewriting; combining first and higher-order computations using p-calculus - towards a semantic of ELAN; distributed first order logic; pushing the frontiers of combining rewrite systems farther outwards; toward sharing libraries of mathematics between theorem provers; negation in combing contraint systems; optimization techniques of combining constraint solvers; the contraint solver collaboration language of BALI; a hybrid language for the analysis of aspectual and temporal phenomena in natural language; combining semantical and syntactical theory reasoning; a generic approach to combining stochastic algorithms with systematic constraint solvers; categorial fibring of logics with terms and binding operators; iterative dialogue and automated proofs; towards heterogeneous specifications; integration of linear arithmetic and goal-oriented resolution for software reasoning; temporalizing description logics.