Skip to content

Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure.

Jrg H. Siekmann, Gert Smolka

Year1981
ProceedingsGWAI

Browse the full KI paper archive.