Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in WASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impact of Treewidth on Grounding and Solving of Answer Set Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Secure Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASP-Core-2 Input Language Format / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fixed-parameter tractable algorithms for abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on alliances and related parameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set solving with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to tractable answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in clasp Series 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-driven answer set solving: from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Driven Answer Set Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded treewidth as a key to tractability of knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted secure sets of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Counting with Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a chain graph in a bipartite permutation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowness, pathwidth, and their application in natural language processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DLV system for knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic-Programming Based ASP-Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable answer-set programming with weight constraints: bounded treewidth is not enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and implementing the stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: All structured programs have small tree width and good register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4604351 / rank
 
Normal rank
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

    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (English)
    0 references

    Identifiers