Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741)
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: Algorithms for computing minimal unsatisfiable subsets of constraints |
scientific article; zbMATH DE number 5236601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for computing minimal unsatisfiable subsets of constraints |
scientific article; zbMATH DE number 5236601 |
Statements
Algorithms for computing minimal unsatisfiable subsets of constraints (English)
0 references
18 February 2008
0 references
Constraint satisfaction
0 references
Minimal unsatifiable subset
0 references
CAMUS
0 references
0 references
0 references
0 references
0.8517807126045227
0 references
0.8403940200805664
0 references
0.8387435674667358
0 references
0.8385622501373291
0 references
0.8357488512992859
0 references
