Treewidth in non-ground answer set solving and alliance problems in graphs (Q5240230)
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 7121981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treewidth in non-ground answer set solving and alliance problems in graphs |
scientific article; zbMATH DE number 7121981 |
Statements
24 October 2019
0 references
answer set programming
0 references
treewidth
0 references
secure set
0 references
defensive alliance
0 references
parameterized complexity
0 references
0 references
0 references
0 references
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (English)
0 references
0.8118440508842468
0 references
0.8083651065826416
0 references
0.7730184197425842
0 references
0.7510242462158203
0 references
0.7474725842475891
0 references
