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

researchr

You are not signed in
Sign in
Sign up

Jörg H. Siekmann, Gert Smolka. Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure. In Jörg H. Siekmann, editor, GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, January 26-31, 1981, Proceedings. Volume 47 of Informatik-Fachberichte, pages 199-200, Springer, 1981.

Abstract is missing.

runs on WebDSL