Recognizing disguised NR(1) instances of the satisfiability problem (Q3898029): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jal/Aspvall80, #quickstatements; #temporary_batch_1736366690727 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(80)90007-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978253773 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55952578 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jal/Aspvall80 / rank | |||
Normal rank | |||
Latest revision as of 22:08, 8 January 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing disguised NR(1) instances of the satisfiability problem |
scientific article |
Statements
Recognizing disguised NR(1) instances of the satisfiability problem (English)
0 references
1980
0 references
satisfiability problem
0 references
Horn set
0 references
negation restricted
0 references
Boolean expressions
0 references
conjunctive normal form
0 references
constructive linear-time algorithm
0 references
