On the relations between SAT and CSP enumerative algorithms (Q1841881)
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: On the relations between SAT and CSP enumerative algorithms |
scientific article; zbMATH DE number 1565917
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relations between SAT and CSP enumerative algorithms |
scientific article; zbMATH DE number 1565917 |
Statements
On the relations between SAT and CSP enumerative algorithms (English)
0 references
26 July 2001
0 references
Davis-Putnam procedure
0 references
Forward Checking
0 references
propositional calculus
0 references
constraint satisfaction
0 references
