Model elimination without contrapositives [chapter]

Peter Baumgartner, Ulrich Furbach
1994 Lecture Notes in Computer Science  
We present modifications of model elimination which do not necessitate the use of contrapositives. These restart model elimination calculi are proven sound and complete. The corresponding proof procedures are evaluated by a number of runtime experiments and they are compared to other well known provers. Finally we relate our results to other calculi, namely the connection method, modified problem reduction format and Near-Horn Prolog.
doi:10.1007/3-540-58156-1_7 fatcat:vsr2p3csifb27bs67lw6iejko4