Some computational aspects of circumscription (Q3474909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some computational aspects of circumscription |
scientific article; zbMATH DE number 4143478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some computational aspects of circumscription |
scientific article; zbMATH DE number 4143478 |
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
0.9299849
0 references
0.9266845
0 references
0.88111806
0 references
0.8686615
0 references
0.8648378
0 references
0 references
0 references
0.8576008
0 references
0.8562641
0 references
