Efficiently explaining CSPs with unsatisfiable subset optimization (Q6535423)
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: Efficiently explaining CSPs with unsatisfiable subset optimization |
scientific article; zbMATH DE number 7781085
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently explaining CSPs with unsatisfiable subset optimization |
scientific article; zbMATH DE number 7781085 |
Statements
Efficiently explaining CSPs with unsatisfiable subset optimization (English)
0 references
20 December 2023
0 references
unsatisfiable subset optimization
0 references
explanations
0 references
constraint satisfaction
0 references
0.86557406
0 references
0.8616233
0 references
0.85493636
0 references
0.8546301
0 references
0.85061467
0 references
