Practical algorithms for unsatisfiability proof and core generation in SAT solvers (Q3568227): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VAMPIRE / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PicoSAT / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3233/aic-2010-0462 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167333876 / rank | |||
Normal rank | |||
Latest revision as of 09:13, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Practical algorithms for unsatisfiability proof and core generation in SAT solvers |
scientific article |
Statements
Practical algorithms for unsatisfiability proof and core generation in SAT solvers (English)
0 references
17 June 2010
0 references
SAT proofs
0 references
unsatisfiable cores
0 references
