An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF (Q1277336): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1023/a:1018924526592 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1525293204 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:20, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF |
scientific article |
Statements
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF (English)
0 references
7 June 1999
0 references
unsatisfiability problem
0 references
