Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MiniSat / rank | |||
Normal rank | |||
Revision as of 07:54, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for computing minimal unsatisfiable subsets of constraints |
scientific article |
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
