Some computational aspects of circumscription (Q3474909): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q129039380, #quickstatements; #temporary_batch_1725411297270 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q197784 / rank | |||
| Property / author | |||
| Property / author: Christos H. Papadimitriou / 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.1145/78935.78936 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007880598 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129039380 / rank | |||
Normal rank | |||
Latest revision as of 02:09, 4 September 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some computational aspects of circumscription |
scientific article |
Statements
Some computational aspects of circumscription (English)
0 references
1990
0 references
circumscription
0 references
first-order logic
0 references
nonmonotonic reasoning
0 references
NP- completeness
0 references
undecidability
0 references
Horn clauses
0 references
model-checking
0 references
