The proceedings volume begin with tutorials offering a logical perspective on resolution theorem
proving, and introducing proofs of determinacy of long games.
This provides a means of using standard resolution theorem
provers for testing order locality and transforming non-local clause sets into local ones.
Kowalski was led to this reconciliatory principle by superb implementation of a 'structure-sharing' resolution theorem
prover at Edinburgh [5, pp.
We spent many hours discussing and arguing the relationship between Planner and resolution theorem