The Complexity of Minimal Inference Problem for Conservative Constraint Languages (Q4633640)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7050850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Minimal Inference Problem for Conservative Constraint Languages |
scientific article; zbMATH DE number 7050850 |
Statements
The Complexity of Minimal Inference Problem for Conservative Constraint Languages (English)
0 references
3 May 2019
0 references
nonmonotonic reasoning
0 references
Schaefer's framework
0 references
algebraic approach
0 references
circumscription
0 references
commonsense reasoning
0 references
computational complexity
0 references
minimal inference problem
0 references
tractability
0 references
1.0000002
0 references
0.8959962
0 references
0.88689303
0 references
0.8760903
0 references
0.8752693
0 references
0.8729135
0 references
0.8728063
0 references
0.8683989
0 references
0.86780345
0 references
