Connection Tableaux with Lazy Paramodulation

Andrei Paskevich
2007 Journal of automated reasoning  
It is well known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tableau calculus for logic with equality. This calculus is based on a lazy form of paramodulation where parts of the unification step become auxiliary subgoals in a tableau and may be subjected to subsequent paramodulations. Our calculus uses ordering constraints and a certain form of the basicness restriction.
doi:10.1007/s10817-007-9089-7 fatcat:kk2qi5tcyvctpn3fhgatfttur4