An open research problem: strong completeness of R Kowalski's connection graph proof procedure (Q4532365)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An open research problem: strong completeness of R Kowalski's connection graph proof procedure |
scientific article; zbMATH DE number 1749616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An open research problem: strong completeness of R Kowalski's connection graph proof procedure |
scientific article; zbMATH DE number 1749616 |
Statements
An open research problem: strong completeness of R Kowalski's connection graph proof procedure (English)
0 references
4 June 2002
0 references
connection graph proof procedure
0 references
clause graph resolution
0 references
theorem proving
0 references
refutation procedure
0 references
soundness
0 references
confluence
0 references
completeness
0 references
0.8669304
0 references
0.8617459
0 references
0.85580176
0 references
0.85518247
0 references
0.8520039
0 references
0.8518896
0 references
0.8509124
0 references
