Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
label / en | label / en | ||
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs | |||
Property / full work available at URL | |||
Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/8465/pdf/OASIcs-ICLP-2017-12.pdf/ / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2791132641 / rank | |||
Normal rank | |||
Property / title | |||
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (English) | |||
Property / title: Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (English) / rank | |||
Normal rank |
Latest revision as of 09:04, 30 July 2024
scientific article; zbMATH DE number 7121981
Language | Label | Description | Also known as |
---|---|---|---|
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
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (English)
0 references