Solving Satisfiability with Less Searching (Q3335000)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3868629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Satisfiability with Less Searching |
scientific article; zbMATH DE number 3868629 |
Statements
Solving Satisfiability with Less Searching (English)
0 references
1984
0 references
complement searching
0 references
satisfiability
0 references
constraint satisfaction
0 references
Search trees
0 references
subtrees
0 references
Davis-Putnam procedure
0 references
conjunctive normal form predicates
0 references
pure literals
0 references
0.8051729202270508
0 references
0.8005148768424988
0 references
0.7998902797698975
0 references
