Connection Tableaux with Lazy Paramodulation [chapter]

Andrei Paskevich
2006 Lecture Notes in Computer Science  
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/11814771_10 fatcat:4lifrskvszesho5yloqaza5w3y