Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733)
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: Fixed-parameter complexity in AI and nonmonotonic reasoning |
scientific article; zbMATH DE number 1767931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed-parameter complexity in AI and nonmonotonic reasoning |
scientific article; zbMATH DE number 1767931 |
Statements
Fixed-parameter complexity in AI and nonmonotonic reasoning (English)
0 references
15 July 2002
0 references
parameterized complexity
0 references
mixed-parameter tractability
0 references
nonmonotonic reasoning
0 references
constraint satisfaction
0 references
conjunctive queries
0 references
prime implicants
0 references
logic programming
0 references
stable models
0 references
circumscription
0 references
0 references
0.8221660852432251
0 references
0.8151941895484924
0 references
0.8146385550498962
0 references
0.7986487150192261
0 references
