Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct (Q3645586)
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: Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct |
scientific article; zbMATH DE number 5635094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct |
scientific article; zbMATH DE number 5635094 |
Statements
18 November 2009
0 references
proof checking
0 references
program-correctness verification
0 references
computable set theory
0 references
cumulative hierarchy
0 references
satisfiability decision procedures
0 references
proof modularization
0 references
proof-verification system
0 references
0.7417612671852112
0 references
0.736579418182373
0 references
0.7317632436752319
0 references
