Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
KI
/
Paper
Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure.
Jrg H. Siekmann
,
Gert Smolka
Venue
National
KI
Year
1981
Proceedings
GWAI
DBLP record
conf/ki/SiekmannS81 ↗
Browse the full
KI paper archive
.