Computational logic and Prolog, three well-known systems of logic, computational logic and complexity, the choice of minimal logic, relevance; the relevance of relevance - complexity considerations, the design of expert systems, relevantizing mathematics, a clash of paradigms; logic and cognitive science - on inference engines, methodological choices, emulation by simulation, computational logic and proof theory, compossible constraints, "my program is better than your program"; from Oracles to Rationauts; minimal logic in perspective; exploring the rules; how does one search for proofs?; accessibility and relevance - accessibility, relevance, proof by cases; genetic screening in IR; how to represemt formulae; how to represent proofs; how to generate proofs; features of a natural proof-finder; on avoiding loops and blind alleys - the Dyckhoff device, fettering, hobbling, tethering; proof theory and proof search - vindication of a proof-theoretic approach, testing proof-finders, looking ahead to IR; summary of proof-theoretic results; deductive debuggers for minimal logic; Pellitier's propositional problems; the associativity problems; some simple Prolog proof-finders.
