Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582)
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: Dealing with satisfiability and n-ary CSPs in a logical framework |
scientific article; zbMATH DE number 6062065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dealing with satisfiability and \(n\)-ary CSPs in a logical framework |
scientific article; zbMATH DE number 6062065 |
Statements
Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (English)
0 references
31 July 2012
0 references
SAT/CSP encoding
0 references
proof system
0 references
resolution method
0 references
0.854441225528717
0 references
0.7783764004707336
0 references
0.7609870433807373
0 references
0.7484700679779053
0 references
0.7442669868469238
0 references
