Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
KI
/
Paper
Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets.
Gert Smolka
Venue
National
KI
Year
1982
Proceedings
GWAI
DBLP record
conf/ki/Smolka82 ↗
Browse the full
KI paper archive
.