There are many cross connections between the methods of Logic and
Artificial Intelligence (Resolution and its extensions) and Integer
Programming (IP) (Branch-and-Bound and Cutting Planes), Methods
applicable to one are applicable to the other and vice versa.  These 
interrelationships will be discussed.

Logic is also applicable to the automated formulation of IP models with
logical constraints. A method of representing and converting problems to Mixed
IP models by the use of Predicate Calculus symbolism will be described.
This talk will also include a coverage of the following topics from both
the Logic and Mathematical Programming points of view: (i) Decidable
Fragments of Mathematics, (ii) The Simplified Nature of Horn Clause Systems, 
(iii) The projection of lattices within polytopes to lower dimensions.