A precondition prover for analogy.


We describe here a prover PC (precondition) that normally acts as an ordinary theorem prover, but which returns a 'precondition' when it is unable to prove the given formula. If F is the formula attempted to be proved and PC returns the precondition Q, then (Q-->F) is a theorem (that PC can prove). This prover, PC, uses a proof-plan. In its simplest mode… (More)