Searching for "Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Completeness of the connection graph proof procedure for unitrefutable clause sets
by Gert Smolka — 1982 — In Proceedings of the 6 th German Workshop on Artificial Intelligence, Informatik Fachberichte 58
…COMPLETENESS OF THE CONNECTION GRAPH PROOF PROCEDURE FOR UNIT-REFUTABLE CLAUSE SETS ABSTRACT…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB